Sciweavers

399 search results - page 30 / 80
» The sandwich line graph
Sort
View
SODA
2000
ACM
99views Algorithms» more  SODA 2000»
13 years 10 months ago
A point-placement strategy for conforming Delaunay tetrahedralization
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
Michael Murphy, David M. Mount, Carl W. Gable
IPL
2006
98views more  IPL 2006»
13 years 9 months ago
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
EJC
2010
13 years 9 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
DCG
2008
82views more  DCG 2008»
13 years 9 months ago
Visibility Graphs of Point Sets in the Plane
The visibility graph V(X) of a discrete point set X R2 has vertex set X and an edge xy for every two points x, y X whenever there is no other point in X on the line segment betw...
Florian Pfender