Sciweavers

84 search results - page 10 / 17
» Connected Rectilinear Graphs on Point Sets
Sort
View
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
The Plane-Width of Graphs
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
Marcin Kaminski, Paul Medvedev, Martin Milanic
STACS
2007
Springer
14 years 1 months ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth
JGT
2007
112views more  JGT 2007»
13 years 7 months ago
The 2-dimensional rigidity of certain families of graphs
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
Bill Jackson, Brigitte Servatius, Herman Servatius
SIAMDM
2000
103views more  SIAMDM 2000»
13 years 7 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
JMIV
2008
97views more  JMIV 2008»
13 years 7 months ago
Fusion Graphs: Merging Properties and Watersheds
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
Jean Cousty, Gilles Bertrand, Michel Couprie, Laur...