A Note on Locating a Set of Points in a Planar Subdivision

DOI10.1137/0208043zbMath0421.68046OpenAlexW2081068678MaRDI QIDQ3854625

Franco P. Preparata

Publication date: 1979

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0208043

zbMATH Keywords

computational geometrypoint set location

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

Geometric complexity of some location problems ⋮ Tetrahedrizing point sets in three dimensions ⋮ Polygonal intersection searching ⋮ Computing largest empty circles with location constraints ⋮ Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra

This page was built for publication: A Note on Locating a Set of Points in a Planar Subdivision