Open Access
Computational geometry.
Reads0
Chats0
About:
The article was published on 1978-01-01 and is currently open access. It has received 366 citations till now. The article focuses on the topics: Computational geometry.read more
Citations
More filters
Proceedings ArticleDOI
I-COLLIDE: an interactive and exact collision detection system for large-scale environments
TL;DR: An exact and interactive collision detection system for large-scale environments, I-COLLIDE, based on pruning multiple-object pairs using bounding boxes and performing exact collision detection between selected pairs of polyhedral models.
Journal ArticleDOI
Autonomous Helicopter Aerobatics through Apprenticeship Learning
TL;DR: These apprenticeship learning algorithms have enabled us to significantly extend the state of the art in autonomous helicopter aerobatics, including the first autonomous execution of a wide range of maneuvers, including in-place flips, in- place rolls, loops and hurricanes.
Journal ArticleDOI
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
Leonidas J. Guibas,John Hershberger,Daniel Leven,Micha Sharir,Micha Sharir,Robert E. Tarjan,Robert E. Tarjan +6 more
TL;DR: Given a triangulation of a simple polygonP, linear-time algorithms for solving a collection of problems concerning shortest paths and visibility withinP are presented.
Journal ArticleDOI
Hierarchic Voronoi skeletons
Robert L. Ogniewicz,Olaf Kübler +1 more
TL;DR: Robust and time-efficient skeletonization of a (planar) shape can be achieved by first regularizing the Voronoi diagram of a shape's boundary points and then by establishing a hierarchic organization of skeleton constituents.
Efficient collision detection for animation and robotics
Ming C. Lin,John Canny +1 more
TL;DR: An opportunistic global path planner algorithm which uses the incremental distance computation algorithm to trace out a one-dimensional skeleton for the purpose of robot motion planning and its performance attests their promise for real-time dynamic simulations as well as applications in a computer generated virtual environment.
References
More filters
Proceedings ArticleDOI
The interface between computational and combinatorial geometry
TL;DR: This work illustrates the rich interface between computational and combinatorial geometry by a series of examples, including k-sets, randomized incremental algorithms, random sampling and partitioning, and analysis of geometric arrangements.
Journal ArticleDOI
An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $\mathbb {R}^{n}$
TL;DR: An efficient improvement of gift wrapping algorithm for determining the convex hull of a finite set of points in $\mathbb {R}^{n}$ space, applying the best restricted area technique inspired from the Method of Orienting Curves.
Journal Article
Privacy Preserving Unsupervised Clustering over Vertically Partitioned Data
TL;DR: In this paper, the authors proposed a clustering algorithmic scheme that ensures privacy and confidentiality of the data without compromising the effectiveness of the clustering algorithm nor imposing high communication costs.
Journal ArticleDOI
An Estimate for the Hausdorff Distance between a Set and Its Convex Hull in Euclidean Spaces of Small Dimension
TL;DR: In this article, it was shown that α-sets are close to convex sets in the Hausdorff metric if the parameter α is small, which is the maximum possible angle under which the projections to this set of points not belonging to the set are visible from these points.
Journal ArticleDOI
Skylines and Other Dominance-Based Queries
Apostolos N. Papadopoulos,Eleftherios Tiakas,Theodoros Tzouramanis,Nikolaos Georgiadis,Yannis Manolopoulos +4 more
TL;DR: This book is a gentle introduction to dominance-based query processing techniques and their applications and aims to present fundamental as well as some advanced issues in the area.