An Output-Sensitive Convex Hull Algorithm for Planar Objects
From MaRDI portal
Recommendations
- The Ultimate Planar Convex Hull Algorithm?
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
- An output sensitive algorithm for discrete convex hulls
- Output-sensitive results on convex hulls, extreme points, and related problems
Cites work
- A convex hull algorithm for discs, and applications
- A linear algorithm for finding the convex hull of a simple polygon
- Almost linear upper bounds on the length of general Davenport-Schinzel sequences
- An O(n\log ^2 h) Time Algorithm for the Three-Dimensional Convex Hull Problem
- An Algorithm for Convex Polytopes
- Applications of random sampling in computational geometry. II
- Computational geometry in a curved world
- Convex hulls of objects bounded by algebraic curves
- Convex hulls of piecewise-smooth Jordan curves
- Finding the convex hull facet by facet
- Finding the convex hull of a simple polygon
- Finding the convex hull of a simple polygon in linear time
- Finding the upper envelope of n line segments in O(n log n) time
- Helly-type theorems and generalized linear programming
- Improved lower bounds on the length of Davenport-Schinzel sequences
- Linear Optimization Queries
- New applications of random sampling in computational geometry
- On ray shooting in convex polytopes
- On the identification of the convex hull of a finite set of points in the plane
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Optimal parallel algorithms for computing convex hulls and for sorting
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- Ray Shooting and Parametric Search
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- The Ultimate Planar Convex Hull Algorithm?
- The upper envelope of piecewise linear functions: Algorithms and applications
Cited in
(18)- Improved algorithms for the farthest colored Voronoi diagram of segments
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm
- An output sensitive algorithm for discrete convex hulls
- Dynamic data structures for fat objects and their applications
- An efficient convex hull algorithm using affine transformation in planar point set
- On computing the convex hull of (piecewise) curved objects
- Convex hulls of spheres and convex hulls of disjoint convex polytopes
- Another Classroom Example of Robustness Problems in Planar Convex Hull Computation
- Three problems about simple polygons
- Locating an obnoxious line among planar objects
- Synergistic solutions for merging and computing planar convex hulls
- An algorithmic toolbox for network calculus
- The Ultimate Planar Convex Hull Algorithm?
- Planar lower envelope of monotone polygonal chains
- scientific article; zbMATH DE number 4060715 (Why is no real title available?)
- Output-sensitive peeling of convex and maximal layers
- Computing pseudotriangulations via branched coverings
This page was built for publication: An Output-Sensitive Convex Hull Algorithm for Planar Objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513200)
