281 search results - page 1 / 57 » On Embedding a Graph on Two Sets of Points |
66
Voted
IJFCS
2006
15 years 16 days ago
2006
86
Voted
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
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 Euclid...
125
Voted
COMGEO
2006
ACM
15 years 18 days ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
97
Voted
GD
2007
Springer
15 years 6 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
107
Voted
DCG
2010
15 years 19 days ago
2010
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...