scientific article; zbMATH DE number 4211552
From MaRDI portal
Publication:3358267
Recommendations
Cited in
(55)- Casting an object with a core
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Finding the \(k\) smallest spanning trees
- Worst-case versus average case complexity of ray-shooting
- Motion planning in the presence of movable obstacles
- Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os
- Connected component and simple polygon intersection searching
- Two-dimensional packet classification and filter conflict resolution in the internet
- Nearest-neighbor searching under uncertainty. I
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
- Triangles in space or building (and analyzing) castles in the air
- The inverse Voronoi problem in graphs. II: Trees
- Distance-Sensitive Planar Point Location
- Succinct and Implicit Data Structures for Computational Geometry
- Persistent predecessor search and orthogonal point location on the word RAM
- A simple entropy-based algorithm for planar point location
- Locating Objects in the Plane Using Global Optimization Techniques
- A robust backward search method based on walk-through for point location on a 3D surface mesh
- Some Results for Elementary Operations
- Priority Search Trees
- Geometric retrieval problems
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- Searching and storing similar lists
- Data Structures for Retrieval on Square Grids
- scientific article; zbMATH DE number 140454 (Why is no real title available?)
- Using persistent data structures for adding range restrictions to searching problems
- New upper bounds for generalized intersection searching problems
- scientific article; zbMATH DE number 1405797 (Why is no real title available?)
- Adaptive planar point location
- Finding the k smallest spanning trees
- Graphics in flatland revisited
- Space-sweep algorithms for parametric optimization
- Selection in monotone matrices and computing k th nearest neighbors
- Dynamic planar point location with optimal query time (extended abstract)
- A near-optimal algorithm for shortest paths among curved obstacles in the plane
- Point location in dynamic planar subdivisions
- New bounds for range closest-pair problems
- Max-throughput for (conservative) k-of-n testing
- Variants of (a,b)-trees with relaxed balance
- Space–Query-Time Tradeoff for Computing the Visibility Polygon
- Persistent predecessor search and orthogonal point location on the word RAM
- Adaptive Point Location in Planar Convex Subdivisions
- Confluent persistence revisited
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- External memory planar point location with logarithmic updates
- Incremental hive graph
- Space-efficient functional offline-partially-persistent trees with applications to planar point location
- Random access in persistent strings and segment selection
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles
- Zip-zip trees: making zip trees more balanced, biased, compact, or persistent
- External memory fully persistent search trees
- A new algorithm for Euclidean shortest paths in the plane
- Dynamic planar point location with optimal query time
- Confluently persistent tries for efficient version control
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 Q3358267)
