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

DOI10.1137/0208043MaRDI QIDQ3854625zbMATH OpenOpenAlexFDO

Authors F. 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)

Cited in

(5)

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

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

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