Dynamic partition trees

DOI10.1007/BF01933260zbMATH Open0727.68042MaRDI QIDQ804289FDOQ804289

Authors Haijo Schipper, Mark H. Overmars 

Publication date 1991

Published in BIT (Search for Journal in Brave)

zbMATH Keywords

shootingconjugation treeshalf-planar range searchingintersection queries

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
• scientific article; zbMATH DE number 177563
• Applications of a new space-partitioning technique
• Dynamic Point Location in General Subdivisions

Cites Work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• 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
• Partitioning with two lines in the plane
• Polygon Retrieval
• Priority Search Trees
• Storing line segments in partition trees
• The design of dynamic data structures
• \(\epsilon\)-nets and simplex range queries

Cited In (5)

• An improved technique for output-sensitive hidden surface removal
• Applications of a new space-partitioning technique
• Dynamic partition trees
• Title not available (Why is no real title available?)
• An optimal algorithm for reporting visible rectangles

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 Q804289)