Planar point location for large data sets

DOI10.1145/944618.944626MaRDI QIDQ5463434zbMATH OpenOpenAlexFDO

Authors Jan Vahrenhold, Klaus Hinrichs

Publication date 4 August 2005

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL http://www.jea.acm.org/2002/VahrenholdLocation/

zbMATH Keywords

external memory planar point location

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• External memory planar point location with logarithmic updates
• I/O-efficient dynamic planar point location
• Optimal external memory planar point enclosure
• External memory planar point location with logarithmic updates
• I/O-efficient point location using persistent B-trees

Cited in

(7)

• Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
• I/O-efficient dynamic planar point location
• On the multisource hyperplanes location problem to fitting set of points
• A simple but effective improvement to the plumb-line algorithm
• scientific article; zbMATH DE number 4082961 (Why is no real title available?)
• I/O-efficient point location using persistent B-trees
• External memory planar point location with logarithmic updates

This page was built for publication: Planar point location for large data sets

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