A space-optimal solution of general region location
From MaRDI portal
Publication:1156491
DOI10.1016/0304-3975(81)90103-1zbMath0468.68075OpenAlexW2029148833MaRDI QIDQ1156491
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
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (7)
I/O-efficient dynamic planar point location ⋮ Two- and three- dimensional point location in rectangular subdivisions ⋮ Simplex Range Searching and Its Variants: A Review ⋮ A space-optimal solution of general region location ⋮ Polygonal intersection searching ⋮ I/O-efficient point location using persistent B-trees ⋮ External memory planar point location with logarithmic updates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A space-optimal solution of general region location
- A note on Euclidean near neighbor searching in the plane
- A new approach to rectangle intersections
- Segments, rectangles, contours
- Multidimensional Searching Problems
- Location of a Point in a Planar Subdivision and Its Applications
This page was built for publication: A space-optimal solution of general region location
