Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

124

ISAAC
2003
Springer

96views Algorithms» more ISAAC 2003»

On the Geometric Dilation of Finite Point Sets

15 years 10 months ago

On the Geometric Dilation of Finite Point Sets

Download web.informatik.uni-bonn.de

Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclidean distance. The maximum of all these ratios is called the geometric dilation of G. Given a ﬁnite point set, we would like to know the smallest possible dilation of any graph that contains the given points. In this paper we

Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl

Real-time Traffic

Arbitrary Points | ISAAC 2003 | Planar Graph | Smallest Possible Dilation |

claim paper

Related Content

» On the geometric dilation of closed curves graphs and point sets

» Light Orthogonal Networks with Constant Geometric Dilation

» Sparse Geometric Graphs with Small Dilation

» Computing Geometric MinimumDilation Graphs Is NPHard

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

» The Number of Triangulations on Planar Point Sets

» Coloring geometric hypergraph defined by an arrangement of halfplanes

» Geometric Set Cover and Hitting Sets for Polytopes in R3

» Surface processing methods for point sets using finite elements

Post Info
More Details (n/a)

Added	07 Jul 2010
Updated	07 Jul 2010
Type	Conference
Year	2003
Where	ISAAC
Authors	Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein

Comments (0)