Applications of a semi-dynamic convex hull algorithm
From MaRDI portal
Recommendations
- Applications of a semi-dynamic convex hull algorithm
- Convex hull properties and algorithms
- Dynamic planar convex hull with optimal query time and O( n n) update time
- Constructing the convex hull of a partially sorted set of points
- An efficient and numerically correct algorithm for the 2D convex hull problem
Cites work
- A faster algorithm for the maximum weighted tardiness problem
- A matching problem in the plane
- Algorithms in combinatorial geometry
- An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
- An efficient algorithm for determining the convex hull of a finite planar set
- An optimal real-time algorithm for planar convex hulls
- Computational geometry. An introduction
- scientific article; zbMATH DE number 432762 (Why is no real title available?)
- Maintenance of configurations in the plane
- On the convex layers of a planar set
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Problem-solving through problems
- The Ultimate Planar Convex Hull Algorithm?
Cited in
(9)- Applications of a semi-dynamic convex hull algorithm
- Upper envelope onion peeling
- Characterizing and efficiently computing quadrangulations of planar point sets
- Separating and shattering long line segments
- Upper envelope onion peeling
- Quadrangulations of planar sets
- Dynamic data structures for fat objects and their applications
- Separating and shattering long line segments
- No quadrangulation is extremely odd
This page was built for publication: Applications of a semi-dynamic convex hull algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056119)