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 the modality of convex polygons
TL;DR: Under two definitions of random convex polygons, the expected modality of arandom convex polygon grows without bound as the number of vertices grows, refuting a conjecture of Aggarwal and Melville.
Journal ArticleDOI
Searching and on-line recognition of star-shaped polygons
TL;DR: A strategy for finding a target of unknown location in a star-shaped polygon with a competitive ratio of 11.52 is proposed and a lower bound of 9 is provided for the Competitive ratio of searching in aStar-shapedpolygon which is close to the upper bound.
Parameterized implementations of classical planar convex hull algorithms and extreme point compuations
TL;DR: C++-implementations of some classical algorithms for computing extreme points of a set of points in two-dimensional space, using the template feature of C ++ to provide generic code, that works with various point types and various implementations of the primitives used in the extreme point computation.
Proceedings ArticleDOI
Visibility techniques applied to robotics
TL;DR: The computation of the visibility polygon of a point or of an edge can be applied instead of the classical methods used for the sensor reading simulation based on ray casting techniques.
Book ChapterDOI
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane
Sanjana Agrawal,R. Inkulu +1 more
TL;DR: A fully dynamic algorithm for maintaining the visibility polygon of any query point, i.e., as the polygonal domain is modified with vertex insertions and deletions to its obstacles, is devised.