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
On exact solutions to the Euclidean bottleneck Steiner tree problem
TL;DR: Based on geometric properties of optimal location of Steiner points, an optimal @Q(nlogn)-time exact algorithm for k=1 and an O(n^2)-time algorithm fork=2 is presented and a special case where there is no edge between Steiners points is presented.
Proceedings ArticleDOI
Algorithms for line transversals in space
David Avis,Rephael Wenger +1 more
TL;DR: It is shown that if every six of a set of lines in space are intersected by a common transversal, then the entire set has a commonTransversal.
Proceedings Article
Balancing minimum spanning trees and shortest-path trees
TL;DR: In this paper, the authors give a simple algorithm to find a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree and obtains the best possible tradeoff.
Journal ArticleDOI
Improving continuity of Voronoi-based interpolation over Delaunay spheres
TL;DR: It is shown that the interpolant generated by the kth-order standard coordinates have C^k continuity on the Delaunay spheres, and a formula for the gradient of the standard coordinates is derived.
Proceedings ArticleDOI
Efficient perspective-accurate silhouette computation and applications
TL;DR: A novel efficient and practical algorithm to compute silhouettes from a sequence of viewpoints under perspective projection based on a point-plane duality in three dimensions, which allows an efficient computation of the silhouette of a polygonal model between consecutive frames.