scientific article; zbMATH DE number 7559224
From MaRDI portal
Publication:5088951
Recommendations
- Dynamic geometric data structures via shallow cuttings
- Succinct and Implicit Data Structures for Computational Geometry
- Towards in-place geometric algorithms and data structures
- scientific article; zbMATH DE number 1424298
- Some dynamic computational geometry problems
- Dynamic geodesic convex hulls in dynamic simple polygons
- Dynamic computational geometry on meshes and hypercubes
- Efficient structures for geometric data management
- Dynamic data structures for realtime management of large geometric scenes (extended abstract)
- Kinetic and dynamic data structures for convex hulls and upper envelopes
Cites work
- A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
- A fully dynamic algorithm for planar width
- Computational geometry. Algorithms and applications.
- Correspondence-based data structures for double-ended priority queues
- Decomposable searching problems I. Static-to-dynamic transformation
- Dynamic connectivity: connecting to networks and geometry
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- Dynamic half-space range reporting and its applications
- Dynamic planar convex hull operations in near-logarithmic amortized time
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Efficient partition trees
- Faster Fully-Dynamic Minimum Spanning Forest
- scientific article; zbMATH DE number 1617248 (Why is no real title available?)
- Maintenance of configurations in the plane
- Maintenance of geometric extrema
- On range searching with semialgebraic sets
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- Optimal halfspace range reporting in three dimensions
- Optimal partition trees
- Orthogonal range searching on the RAM, revisited
- Reporting points in halfspaces
- Semi-Online Maintenance of Geometric Optima and Measures
- Simplex Range Searching and Its Variants: A Review
- The design of dynamic data structures
Cited in
(11)- Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
- Dynamic geometric data structures via shallow cuttings
- Two approaches to building time-windowed geometric data structures
- Succinct and Implicit Data Structures for Computational Geometry
- Resolving SINR Queries in a Dynamic Setting
- Towards in-place geometric algorithms and data structures
- Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
- Reachability problems for transmission graphs
- Reachability problems for transmission graphs
- Dynamic data structures for \(k\)-nearest neighbor queries
- On undecided LP, clustering and active learning
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 Q5088951)
