Edge-Unfolding Nearly Flat Convex Caps

DOI10.4230/LIPICS.SOCG.2018.64zbMATH Open1489.68371arXiv1707.01006OpenAlexW2963218502MaRDI QIDQ5116524FDOQ5116524

Joseph O'Rourke

Publication date: 18 August 2020

Abstract: The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in R^3 has an edge-unfolding to a non-overlapping polygon in the plane. A convex cap is the intersection of the surface of a convex polyhedron and a halfspace. "Nearly flat" means that every outer face normal forms a sufficiently small angle phi < Phi with the z-axis orthogonal to the halfspace bounding plane. The size of Phi depends on the acuteness gap alpha: if every triangle angle is at most pi/2-alpha, then Phi ~= 0.36 sqrt(alpha) suffices; e.g., for alpha ~= 3deg, Phi = 5deg. Even if C is closed to a polyhedron by adding the convex polygonal base under C, this polyhedron can be edge-unfolded without overlap. The proof employs the recent concepts of angle-monotone and radially monotone curves. The proof is constructive, leading to a polynomial-time algorithm for finding the edge-cuts, at worst O(n^2); a version has been implemented.

Full work available at URL: https://arxiv.org/abs/1707.01006

zbMATH Keywords

polyhedraunfolding

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cites Work

• Title not available (Why is that?)
• Nonobtuse triangulations of PSLGs
• Title not available (Why is that?)
• Affine unfoldings of convex polyhedra
• Increasing-Chord Graphs On Point Sets
• Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
• Pseudo-edge unfoldings of convex polyhedra

Cited In (1)

• Edge-unfolding nested prismatoids

This page was built for publication: Edge-Unfolding Nearly Flat Convex Caps

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