On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
Intersection detection and separators for simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Incremental algorithms for collision detection between solid models
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Efficient collision detection for moving polyhedra
Proceedings of the eleventh annual symposium on Computational geometry
Computing the visibility graph via pseudo-triangulations
Proceedings of the eleventh annual symposium on Computational geometry
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Pseudo-triangulations: theory and applications
Proceedings of the twelfth annual symposium on Computational geometry
Fast algorithms for collision and proximity problems involving moving geometric objects
Computational Geometry: Theory and Applications
Proceedings of the fourteenth annual symposium on Computational geometry
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Data structures for mobile data
Journal of Algorithms
Kinetic collision detection between two simple polygons
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Separation-sensitive collision detection for convex objects
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
Proceedings of the eighteenth annual symposium on Computational geometry
Collision Detection for Interactive Graphics Applications
IEEE Transactions on Visualization and Computer Graphics
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Allocating vertex π-guards in simple polygons via pseudo-triangulations
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Planar minimally rigid graphs and pseudo-triangulations
Proceedings of the nineteenth annual symposium on Computational geometry
A combinatorial approach to planar non-colliding robot arm motion planning
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
Kinetic collision detection with fast flight plan changes
Information Processing Letters
Kinetic and dynamic data structures for convex hulls and upper envelopes
Computational Geometry: Theory and Applications
Velocity-Aligned Discrete Oriented Polytopes for Dynamic Collision Detection
IEEE Transactions on Visualization and Computer Graphics
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms (TALG)
Shooting permanent rays among disjoint polygons in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry
Computers and Electronics in Agriculture
Resolving Loads with Positive Interior Stresses
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Kinetic collision detection with fast flight plan changes
Information Processing Letters
Continuous collision detection between two 2D curved-edge polygons under rational motions
GMP'08 Proceedings of the 5th international conference on Advances in geometric modeling and processing
A kinetic triangulation scheme for moving points in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
A kinetic triangulation scheme for moving points in the plane
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the two polygons, called the external relative geodesic triangulation, which certifies their disjointness. We show how this subdivision can be maintained as a kinetic data structure when the polygons are moving, and analyze its performance in the kinetic setting.