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
Journal ArticleDOI
Efficient point location in a convex spatial cell-complex
TL;DR: A new approach to point location in a three-dimensional cell complex {\em P}, which may be viewed as a nontrivial generalization of a corresponding two-dimensional technique due to Sarnak and Tarjan is proposed.
Proceedings ArticleDOI
Vehicle size and orientation estimation using geometric fitting
TL;DR: Methods for estimation of length and width of vehicles based on scanning laser radar data and the use of the minimum rectangle estimator to retrieve initial parameters for fitting of more complex shapes is discussed.
Journal ArticleDOI
Enhanced atom-by-atom assembly of arbitrary tweezer arrays
Kai-Niklas Schymik,Vincent Lienhard,Daniel Barredo,Pascal Scholl,H. J. Williams,Antoine Browaeys,Thierry Lahaye +6 more
TL;DR: In this article, the capability of an atom-by-atom assembler to create large arrays of neutral atoms is described and an overview of advances that can be realized through several new sorting algorithms, including one that enables the assembly of arbitrary, nonregular target arrays.
Journal ArticleDOI
Compact interval trees: a data structure for convex hulls
TL;DR: A data structure called a compact interval tree is introduced that supports common tangent computations, as well as the standard binary-search-based queries, in O(logn) time apiece and beats the lower bound for algorithms that store the polygons in independent arrays.
Proceedings ArticleDOI
Some complexity results for the Traveling Salesman Problem
TL;DR: It is shown that, unless P&equil;NP, local search algorithms for the Traveling Salesman Problem having polynomial time complexity per iteration will generate solutions arbitrarily far from the optimal.