Dynamic partition trees

DOI10.1007/3-540-52846-6_108MaRDI QIDQ5056121zbMATH OpenOpenAlexFDO

Authors Haijo Schipper, Mark H. Overmars

Publication date 9 December 2022

Published in SWAT 90 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52846-6_108

Mathematics Subject Classification ID

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

Recommendations

• Dynamic partition trees
• Dynamic Trees and Dynamic Point Location
• Storing line segments in partition trees
• Applications of a new space-partitioning technique
• Dynamic Point Location in General Subdivisions

Cites work

• -nets and simplex range queries
• A simple output-sensitive algorithm for hidden surface removal
• An improved technique for output-sensitive hidden surface removal
• Decomposable searching problems
• Halfplanar range search in linear space and \(O(n^{0.695})\) query time
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Partitioning with two lines in the plane
• Polygon Retrieval
• Priority Search Trees
• Storing line segments in partition trees
• The design of dynamic data structures

Cited in

(4)

• Applications of a new space-partitioning technique
• Efficient partition trees
• scientific article; zbMATH DE number 177563 (Why is no real title available?)
• Dynamic partition trees

This page was built for publication: Dynamic partition trees

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