Let G = (S,E) be a plane straight line graph on a finite point set S R2 in general position. For a point p 2 S let the maximum incident angle of p in G be the maximum angle between any two edges of G that appear consecutively in the circular order of the edges incident to p. A plane straight line graph is called '-open if each vertex has an incident angle of size at least '. In this paper we study the following type of question: What is the maximum angle ' such that for any finite set S R2 of points in general position we can find a graph from a certain class of graphs on S that is '-open? In particular, we consider the classes of triangulations, spanning trees, and paths on S and give tight bounds in all but one cases.
|Publication status||Published - 2007|
|Event||23rd European Workshop on Computational Geometry (EuroCG 2007) - Graz, Switzerland|
Duration: 19 Mar 2007 → 21 Mar 2007
Conference number: 23
|Workshop||23rd European Workshop on Computational Geometry (EuroCG 2007)|
|Period||19/03/07 → 21/03/07|