Embedding Point Sets into Plane Graphs of Small Dilation

15 years 10 months ago

Download web.informatik.uni-bonn.de

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 circle, this question seems hard to answer; it is not even clear if there exists a

Annette Ebbers-Baumann, Ansgar Grüne, Marek K

Real-time Traffic

ISAAC 2005 | Minimum Possible Dilation | Plane Graphs |

claim paper

» On the Geometric Dilation of Finite Point Sets

» Sparse Geometric Graphs with Small Dilation

» Computing Geometric MinimumDilation Graphs Is NPHard

» On the Dilation of Delaunay Triangulations of Points in Convex Position

» Universal Sets of n Points for 1Bend Drawings of Planar Graphs with n Vertices

» Universal Sets of n Points for Onebend Drawings of Planar Graphs with n Vertices

» Pointset embeddings of plane 3trees

» Colored Simultaneous Geometric Embeddings and Universal Pointsets

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ISAAC
Authors	Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas

Comments (0)

Sciweavers

Embedding Point Sets into Plane Graphs of Small Dilation

ISAAC 2005 | Minimum Possible Dilation | Plane Graphs |

Explore & Download

Productivity Tools

Sciweavers