Join Our Newsletter

4 search results - page 1 / 1» Point-set embeddings of plane 3-trees |

ISAAC

2005

Springer

12 years 11 months ago
2005

Springer

Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as ﬁve points evenly placed on the ci...

COMGEO

2012

ACM

11 years 1 months ago
2012

ACM

A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...

JGAA

2006

12 years 6 months ago
2006

Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...

WG

2010

Springer

12 years 4 months ago
2010

Springer

Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...