A Note on Locating a Set of Points in a Planar Subdivision
From MaRDI portal
Publication:3854625
DOI10.1137/0208043zbMath0421.68046MaRDI QIDQ3854625
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
68Q25: Analysis of algorithms and problem complexity
Related Items
Geometric complexity of some location problems, Polygonal intersection searching, Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra, Tetrahedrizing point sets in three dimensions, Computing largest empty circles with location constraints