I/O-Efficient Point Location in a Set of Rectangles

DOI10.1007/978-3-540-78773-0_59MaRDI QIDQ5458571zbMATH OpenOpenAlexFDO

Authors Yakov Nekrich

Publication date 15 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78773-0_59

Mathematics Subject Classification ID

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

Recommendations

• I/O-efficient dynamic planar point location
• I/O-efficient point location using persistent B-trees
• scientific article; zbMATH DE number 1305387
• scientific article; zbMATH DE number 140454
• Efficient Point Location in a Convex Spatial Cell-Complex
• scientific article; zbMATH DE number 1617272
• I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
• Dynamic rectangular point location, with an application to the closest pair problem
• Structure of the Efficient Point Set
• A space-efficient framework for dynamic point location

Cited in

(9)

• Orthogonal point location and rectangle stabbing queries in 3-d
• Optimal external memory planar point enclosure
• Two- and three- dimensional point location in rectangular subdivisions
• Algorithms – ESA 2004
• I/O-efficient data structures for colored range and prefix reporting
• Improved bounds for orthogonal point enclosure query and point location in orthogonal subdivisions in \(\mathbb R^3\)
• Orthogonal point location and rectangle stabbing queries in 3-d
• On Dominance Reporting in 3D
• I/O-efficient dynamic planar point location

This page was built for publication: I/O-Efficient Point Location in a Set of Rectangles

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