A space-optimal solution of general region location
From MaRDI portal
Publication:1156491
DOI10.1016/0304-3975(81)90103-1zbMATH Open0468.68075OpenAlexW2029148833MaRDI QIDQ1156491FDOQ1156491
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
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Cites Work
- Title not available (Why is that?)
- Multidimensional Searching Problems
- Location of a Point in a Planar Subdivision and Its Applications
- Title not available (Why is that?)
- Segments, rectangles, contours
- A note on Euclidean near neighbor searching in the plane
- A new approach to rectangle intersections
- Title not available (Why is that?)
- A space-optimal solution of general region location
Cited In (7)
- Polygonal intersection searching
- Two- and three- dimensional point location in rectangular subdivisions
- A space-optimal solution of general region location
- Simplex Range Searching and Its Variants: A Review
- I/O-efficient dynamic planar point location
- 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)
