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
Map Polygon-Polygon Objects Spatial Conflicts Solution Using Simulated Annealing
Youliang Chen,Zhaoru Wang +1 more
TL;DR: This paper guides the displacement of conflicted objects using simulated annealing, a very complex operation which involves the type definitions, constraint conditions, direction and the size of the displacement and so on.
Journal ArticleDOI
Barycentric quantization for planning in continuous domains
TL;DR: This work proposes a scheme based on barycentric approximations that effectively converts the continuous dynamics into a Markov decision process, and demonstrates that it can be viewed both as an approximation to the continuous Dynamics, as well as a value function approximator over the continuous domain.
Proceedings ArticleDOI
The Application Based on Bracket Method for Planar Computational Geometry
TL;DR: This paper studies two basic problems about planar computational geometry with bracket method, how to judge whether a point is inside a given convex polygon, and how to compute the convex hull of planar points.
Journal ArticleDOI
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
TL;DR: It is shown that a sparse supergraph of these geometric graphs can be computed in asymptotically optimal time and space, and requiring only double precision arithmetic, which is proved to be optimal.
Book ChapterDOI
Linear Complexity Algorithms for Visually Appealing Routes in the Vehicle Routing Problem
Philip Kilby,Dan C. Popescu +1 more
TL;DR: In this paper, the authors propose to use new features which are well correlated with the convex hull area but are significantly easier to implement, having O(n) computational complexity instead of \(O(n \hbox {log} n)\).