A space-optimal solution of general region location

DOI10.1016/0304-3975(81)90103-1MaRDI QIDQ1156491zbMATH OpenOpenAlexFDO

Authors Herbert Edelsbrunner, Hermann Maurer

Publication date 1981

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(81)90103-1

zbMATH Keywords

planar region location

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cites work

• A new approach to rectangle intersections
• A note on Euclidean near neighbor searching in the plane
• A space-optimal solution of general region location
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3557226 (Why is no real title available?)
• scientific article; zbMATH DE number 3617566 (Why is no real title available?)
• Location of a Point in a Planar Subdivision and Its Applications
• Multidimensional Searching Problems
• Segments, rectangles, contours

Cited in

(7)

• A space-optimal solution of general region location
• Polygonal intersection searching
• I/O-efficient dynamic planar point location
• Simplex Range Searching and Its Variants: A Review
• Two- and three- dimensional point location in rectangular subdivisions
• I/O-efficient point location using persistent B-trees
• External memory planar point location with logarithmic updates

This page was built for publication: A space-optimal solution of general region location

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