On computing the convex hull of (piecewise) curved objects

DOI10.1007/s11786-012-0111-zzbMath1271.68230OpenAlexW2012596812MaRDI QIDQ1948676

Bert Jüttler, Franz Aurenhammer

Publication date: 24 April 2013

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-012-0111-z

zbMATH Keywords

convex hullcircular arcssupport function

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

Approximate polytope ensemble for one-class classification ⋮ QuickhullDisk: a faster convex hull algorithm for disks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex hulls of objects bounded by algebraic curves
• Computational geometry in a curved world
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• On-line construction of the convex hull of a simple polyline
• A convex hull algorithm for discs, and applications
• Approximation of planar convex sets from hyperplane probes
• An algorithm for constructing the convex hull of a set of spheres in dimension \(d\)
• 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
• The Voronoi diagram of curved objects
• COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION
• The Ultimate Planar Convex Hull Algorithm?
• Convex hulls of piecewise-smooth Jordan curves
• Matching Shapes with a Reference Point
• Convex hull of a planar set of straight and circular line segments
• An Output-Sensitive Convex Hull Algorithm for Planar Objects
• Power Diagrams: Properties, Algorithms and Applications
• Algorithms – ESA 2005

This page was built for publication: On computing the convex hull of (piecewise) curved objects