A new point-location algorithm and its practical efficiency: comparison with existing algorithms
From MaRDI portal
Publication:3721830
DOI10.1145/357337.357338zbMath0592.68059OpenAlexW2057476951MaRDI QIDQ3721830
Masato Edahiro, Takao Asano, Iwao Kokubo
Publication date: 1984
Published in: ACM Transactions on Graphics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357337.357338
designplanar graphsgeometric algorithmscomputational geometrymultidimensional searchbucketingcomputer-aidedplanar sudivisionsVSLI design
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (10)
Representing stereo data with the Delaunay triangulation ⋮ Adaptive Point Location in Planar Convex Subdivisions ⋮ Optimal cooperative search in fractional cascaded data structures ⋮ Parallel construction of subdivision hierarchies ⋮ On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain ⋮ Parallel algorithms for fractional and maximal independent sets in planar graphs ⋮ Dynamic planar point location with optimal query time ⋮ A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING ⋮ I/O-efficient point location using persistent B-trees ⋮ Dynamic planar point location with optimal query time
This page was built for publication: A new point-location algorithm and its practical efficiency: comparison with existing algorithms
