Convex hull of a planar set of straight and circular line segments
From MaRDI portal
Publication:4484714
DOI10.1108/02644409910304086zbMath0962.65016OpenAlexW2082668219MaRDI QIDQ4484714
D. E. R. Clark, Yong Yue, J. L. Murray, J. R. Corney
Publication date: 14 June 2001
Published in: Engineering Computations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/02644409910304086
Related Items (2)
On computing the convex hull of (piecewise) curved objects ⋮ QuickhullDisk: a faster convex hull algorithm for disks
Cites Work
- An efficient and numerically correct algorithm for the 2D convex hull problem
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Finding the convex hull of a simple polygon in linear time
- Parallel implementation of 3D convex-hull algorithm
- Applications of a semi-dynamic convex hull algorithm
- Recognition of form features using convex decomposition
- Distributed algorithm for the planar convex hull problem
- Robust gift wrapping for the three-dimensional convex hull
- An efficient algorithm for determining the convex hull of a finite planar set
- On the identification of the convex hull of a finite set of points in the plane
- Convex hulls of piecewise-smooth Jordan curves
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- A New Convex Hull Algorithm for Planar Sets
- An optimal real-time algorithm for planar convex hulls
- An Algorithm for Convex Polytopes
This page was built for publication: Convex hull of a planar set of straight and circular line segments
