Recursive Calculation of Relative Convex Hulls

DOI10.1007/978-3-642-19867-0_22MaRDI QIDQ3000706zbMATH OpenOpenAlexFDO

Authors Gisela Klette

Publication date 19 May 2011

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19867-0_22

zbMATH Keywords

minimum length polygonminimum perimeter polygonpath planningrelative convex hullshortest path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1182912
• Relative convex hull determination from convex hulls in the plane
• On recursive refinement of convex polygons
• Computing the convex hull in a hammock
• Computing the convex hull of line intersections
• On the definition and computation of rectilinear convex hulls
• Computing D-convex hulls in the plane
• On computing the convex hull of (piecewise) curved objects
• Calculation of partially convex hulls and approximations for finite planar sets
• Computing the integer hull of convex polyhedral sets

Cited in

(3)

• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
• Relative convex hull determination from convex hulls in the plane
• Fast and exact convex and concave decomposition of digitized shapes

This page was built for publication: Recursive Calculation of Relative Convex Hulls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000706)