Union and split operations on dynamic trapezoidal maps
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 437528
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Dynamic orthogonal segment intersection search
- A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
- Dynamic Point Location in General Subdivisions
Cites work
- scientific article; zbMATH DE number 410386 (Why is no real title available?)
- scientific article; zbMATH DE number 431985 (Why is no real title available?)
- scientific article; zbMATH DE number 53528 (Why is no real title available?)
- scientific article; zbMATH DE number 1220053 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- Applications of random sampling in computational geometry. II
- Applications of random sampling to on-line algorithms in computational geometry
- Design and implementation of an efficient priority queue
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Fully dynamic Delaunay triangulation in logarithmic expected per operation
- New applications of random sampling in computational geometry
- On the randomized construction of the Delaunay tree
- Towards dynamic randomized algorithms in computational geometry
Cited in
(2)
This page was built for publication: Union and split operations on dynamic trapezoidal maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841116)
