Efficient Point Location in a Convex Spatial Cell-Complex
From MaRDI portal
Publication:3990653
DOI10.1137/0221020zbMath0753.68094MaRDI QIDQ3990653
Roberto Tamassia, Franco P. Preparata
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221020
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Related Items
Dynamic reachability in planar digraphs with one source and one sink, Linear data structures for fast ray-shooting amidst convex polyhedra, Complexity of projected images of convex subdivisions, Vertical decompositions for triangles in 3-space, Dynamic Trees and Dynamic Point Location