A convex hull algorithm for discs, and applications
From MaRDI portal
Publication:1188286
DOI10.1016/0925-7721(92)90015-KzbMath0772.68108OpenAlexW4212788998MaRDI QIDQ1188286
Publication date: 13 August 1992
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(92)90015-k
Related Items (17)
The visibility graph of congruent discs is Hamiltonian ⋮ Separability by two lines and by nearly straight polygonal chains ⋮ An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) ⋮ Packing circles into perimeter-minimizing convex hulls ⋮ Convex hulls of spheres and convex hulls of disjoint convex polytopes ⋮ On computing the convex hull of (piecewise) curved objects ⋮ Linear approximation of simple objects ⋮ Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas ⋮ A dynamic sampling approach towards computing Voronoi diagram of a set of circles ⋮ Separating objects in the plane by wedges and strips ⋮ Largest bounding box, smallest diameter, and related problems on imprecise points ⋮ Computing pseudotriangulations via branched coverings ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ Near optimal minimal convex hulls of disks ⋮ Maximal and minimal balls ⋮ An Output-Sensitive Convex Hull Algorithm for Planar Objects ⋮ Finding the Convex Hull of Discs in Parallel
Cites Work
- Unnamed Item
- Unnamed Item
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- A sweepline algorithm for Voronoi diagrams
- Stabbing line segments
- On the ball spanned by balls
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- On a problem of Davenport and Schinzel
- Power Diagrams: Properties, Algorithms and Applications
- A Combinatorial Problem Connected with Differential Equations
This page was built for publication: A convex hull algorithm for discs, and applications
