Angle-monotone Paths in Non-obtuse Triangulations

07/01/2017
by   Anna Lubiw, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2018

Angle-Monotone Graphs: Construction and Local Routing

A geometric graph in the plane is angle-monotone of width γ if every pai...
research
06/12/2018

Drawing a Rooted Tree as a Rooted y-Monotone Minimum Spanning Tree

Given a rooted point set P, the rooted y-Monotone Minimum Spanning Tree ...
research
07/04/2017

Edge-Unfolding Nearly Flat Convex Caps

This paper proves a conjecture from [LO17]: A nearly flat, acutely trian...
research
06/22/2018

Uniform 2D-Monotone Minimum Spanning Graphs

A geometric graph G is xy-monotone if each pair of vertices of G is conn...
research
08/20/2020

Plane Spanning Trees in Edge-Colored Simple Drawings of K_n

Károlyi, Pach, and Tóth proved that every 2-edge-colored straight-line d...
research
12/18/2020

Upward Point Set Embeddings of Paths and Trees

We study upward planar straight-line embeddings (UPSE) of directed trees...
research
12/15/2022

Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems

We leverage path differentiability and a recent result on nonsmooth impl...

Please sign up or login with your details

Forgot password? Click here to reset