Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
From MaRDI portal
Publication:4327822
DOI10.1006/jagm.1995.1010zbMath0939.68936OpenAlexW2136797686WikidataQ56970839 ScholiaQ56970839MaRDI QIDQ4327822
Mark T. de Berg, Marc J. van Kreveld
Publication date: 26 February 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1995.1010
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS ⋮ 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects ⋮ Unnamed Item ⋮ Random access in persistent strings and segment selection ⋮ On Dominance Reporting in 3D ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions ⋮ Point location in fat subdivisions ⋮ Optimization on directionally convex sets ⋮ Algorithms for three-dimensional dominance searching in linear space.
