Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons

DOI10.1145/513400.513423zbMATH Open1414.68130OpenAlexW1998566446MaRDI QIDQ4557553FDOQ4557553

David Kirkpatrick, Bettina Speckmann

Publication date: 23 November 2018

Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/513400.513423

Recommendations

• scientific article; zbMATH DE number 1786516
• scientific article; zbMATH DE number 1617271
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• Kinetic collision detection between two simple polygons.
• scientific article; zbMATH DE number 1305397

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (11)

• Kinetic collision detection with fast flight plan changes
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Kinetic sorting and kinetic convex hulls
• Pointed binary encompassing trees: simple and optimal
• Kinetic collision detection for balls
• Kinetic collision detection for convex fat objects
• Minimum weight pseudo-triangulations
• Collision detection for deforming necklaces
• Relative convex hulls in semi-dynamic arrangements
• Convexity minimizes pseudo-triangulations
• Kinetic collision detection between two simple polygons.

This page was built for publication: Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557553)