Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
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
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Separation-sensitive collision detection for convex objects
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Cylindrical static and kinetic binary space partitions
Computational Geometry: Theory and Applications
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
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Minimum link paths in polygons and related problems
Minimum link paths in polygons and related problems
Kinetic vertical decomposition trees
Kinetic vertical decomposition trees
Kinetic collision detection between two simple polygons
Computational Geometry: Theory and Applications
| Hi-index | 0.89 |
We show how to augment a kinetic data structure for collision detection between translating polygons with the ability to make fast flight plan changes. This allows us to update the KDS after a moving polygon changes its motion in O(logn) time, instead of the @W(n) worst-case time needed by previous kinetic data structures. The key to our approach is replacing the KDS priority queue by a dynamic convex hull that represents the certificates of the KDS.