Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
From MaRDI portal
Publication:3558019
Recommendations
- Dynamic planar orthogonal point location in sublogarithmic time
- A time-space trade-off for triangulations of points in the plane
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- On a class of \(O(n^2)\) problems in computational geometry
- On a class of \(O(n^ 2)\) problems in computational geometry
- On geodesic properties of polygons relevant to linear time triangulation
- Sublinear geometric algorithms
- Sublinear Geometric Algorithms
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
Cited in
(12)- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- On constant factors in comparison-based geometric algorithms and data structures
- scientific article; zbMATH DE number 1405797 (Why is no real title available?)
- On constant factors in comparison-based geometric algorithms and data structures
- Sublinear Geometric Algorithms
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- Polynomial data structure lower bounds in the group model
- Succinct and Implicit Data Structures for Computational Geometry
- Succinct geometric indexes supporting point location queries
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
- Random access in persistent strings and segment selection
- Adaptive Point Location in Planar Convex Subdivisions
This page was built for publication: Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558019)
