scientific article; zbMATH DE number 140454

MaRDI QIDQ4028870zbMATH OpenFDO

Authors Roberto Tamassia, F. P. Preparata

Publication date 28 March 1993

zbMATH Keywords

cell complexconvex polyhedraldynamic planar- point location techniquespatial point location

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Data structures (68P05)

Recommendations

• Efficient Point Location in a Convex Spatial Cell-Complex
• Fully Dynamic Point Location in a Monotone Subdivision
• scientific article; zbMATH DE number 4211552
• Two- and three- dimensional point location in rectangular subdivisions
• Point location in fat subdivisions

Cited in

(15)

• Euclidean minimum spanning trees and bichromatic closest pairs
• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
• Point location in fat subdivisions
• On constant factors in comparison-based geometric algorithms and data structures
• An algorithm for generalized point location and its applications
• On point location and motion planning among simplices
• Determining the spatial containment of a point in general polyhedra
• scientific article; zbMATH DE number 4211552 (Why is no real title available?)
• Efficient Point Location in a Convex Spatial Cell-Complex
• scientific article; zbMATH DE number 1182923 (Why is no real title available?)
• On constant factors in comparison-based geometric algorithms and data structures
• On Point Location and Motion Planning among Simplices
• Space-sweep algorithms for parametric optimization
• Two- and three- dimensional point location in rectangular subdivisions
• I/O-Efficient Point Location in a Set of Rectangles

This page was built for publication:

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