6740 search results - page 71 / 1348 » An s -Hamiltonian Line Graph Problem |
148
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
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...
IPL
2006
15 years 3 months ago
2006
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...
ICIP
2005
IEEE
16 years 4 months ago
2005
IEEE
In this paper, we present a method for finding the closed form solutions to the problem of determining the pose of a camera with respect to a given set of parallel lines in 3D spac...
119
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
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 ...
100
click to vote
DCG
2008
15 years 3 months ago
2008
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...