A segment-tree based kinetic BSP

DOI10.1145/378583.378647MaRDI QIDQ5361568zbMATH OpenOpenAlexFDO

Authors João L. D. Comba, Mark de Berg, Leonidas Guibas

Publication date 29 September 2017

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

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1303547
• Cylindrical static and kinetic binary space partitions
• Kinetic Euclidean minimum spanning tree in the plane
• scientific article; zbMATH DE number 1947377
• Lower bounds for kinetic planar subdivisions

Cited in

(4)

• Kinetic spanners in \(\mathbb R^{d}\)
• Lower bounds for kinetic planar subdivisions
• Kinetic collision detection for balls
• Kinetic collision detection for convex fat objects

This page was built for publication: A segment-tree based kinetic BSP

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