Intersection of convex objects in two and three dimensions
Journal of the ACM (JACM)
Introduction to algorithms
Determining the separation of preprocessed polyhedra: a unified approach
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Intersection detection and separators for simple polygons
SCG '92 Proceedings of the eighth 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
Lower bounds for kinetic planar subdivisions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete 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 collision detection for simple polygons
Proceedings of the sixteenth annual symposium on Computational geometry
Compact Voronoi Diagrams for Moving Convex Polygons
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Implicitly Searching Convolutions and Computing Depth of Collision
SIGAL '90 Proceedings of the International Symposium on Algorithms
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
Proceedings of the eighteenth annual symposium on Computational geometry
Pseudotriangulations, polytopes, and how to expand linkages
Proceedings of the eighteenth annual symposium on Computational geometry
Tight degree bounds for pseudo-triangulations of points
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Kinetic and dynamic data structures for convex hulls and upper envelopes
Computational Geometry: Theory and Applications
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms (TALG)
The stochastic walk algorithms for point location in pseudo-triangulations
Advances in Engineering Software
Construction of pseudo-triangulation by incremental insertion
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
| Hi-index | 0.00 |
We extend the kinetic data structure for collision detection between moving simple polygons introduced in [14] to incorporate a hierarchical representation of convex chains. This permits us to define and maintain an adaptive hierarchical outer approximation for convex polygons. This representation can be exploited to give separation sensitive complexity bounds for kinetic collision detection comparable to those of Erickson et al. [11] who deal with pairs of convex polygons. More importantly, it forms the basis of a more general representation, developed in a companion paper, that applies to collections of general (not necessarily convex) polygonal objects.