Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions

DOI10.1006/JAGM.1995.1010MaRDI QIDQ4327822zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mark de Berg, Marc 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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Cited in

(9)

• Optimization on directionally convex sets
• Point location in fat subdivisions
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
• Algorithms for three-dimensional dominance searching in linear space.
• Processing an offline insertion-query sequence with applications
• On Dominance Reporting in 3D
• Orthogonal point location and rectangle stabbing queries in 3-d
• Random access in persistent strings and segment selection

This page was built for publication: Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions

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