Searching and storing similar lists
From MaRDI portal
Publication:3742729
DOI10.1016/0196-6774(86)90004-0zbMath0605.68053OpenAlexW1971550377MaRDI QIDQ3742729
Publication date: 1986
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(86)90004-0
3- dimensional point location algorithmoptimal data structureoptimal planar point location algorithmrepresentation scheme for polyhedra
Related Items
Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment, Fractional cascading. I: A data structuring technique, Fractional cascading. II: Applications, On the two-dimensional Davenport-Schinzel problem, An algorithm for generalized point location and its applications, Making data structures persistent, Queries on Voronoi diagrams on moving points, New parallel algorithms for convex hull and triangulation in 3-dimensional space, Versioning Tree Structures by Path-Merging, Space-efficient functional offline-partially-persistent trees with applications to planar point location, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Output-sensitive generation of the perspective view of isothetic parallelepipeds, Intersection queries in sets of disks, Quasi-optimal upper bounds for simplex range searching and new zone theorems, Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time., Output-sensitive generation of the perspective view of isothetic parallelepipeds, Intersection queries in sets of disks, EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION, Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra, Dynamic Trees and Dynamic Point Location, Succinct and Implicit Data Structures for Computational Geometry, Complexity of projected images of convex subdivisions, Efficient versioning for matrix structures
