2017/07/01 by Anna Lubiw, Lubiw, Anna, Joseph O’Rourke +1
Computer Science · Engineering · #52B10 #52C99 #Advanced Numerical Analysis Techniques #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Digital Image Processing Techniques #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #G.2.2
paper · pdf · doi:10.48550/arxiv.1707.00219
openalex publication_date 2017/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We reprove a result of Dehkordi, Frati, and Gudmundsson: every two vertices in a non-obtuse triangulation of a point set are connected by an angle-monotone path--an xy-monotone path in an appropriately rotated coordinate system. We show that this result cannot be extended to angle-monotone spanning trees, but can be extended to boundary-rooted spanning forests. The latter leads to a conjectural edge-unfolding of sufficiently shallow polyhedral convex caps.