91 search results - page 6 / 19 » Triangulating a Plane |
COMGEO
2004
ACM
13 years 9 months ago
2004
ACM
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
WG
2010
Springer
13 years 8 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...
SSPR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In order to use structural techniques from graph-based pattern recognition, a first necessary step consists in extracting a graph in an automatic way from an image. We pr...
GD
2004
Springer
14 years 3 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...