91 search results - page 8 / 19 » Triangulating a Plane |
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
96
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
In this paper, we describe the explicit application of articulation constraints for estimating the motion of a system of planes. We relate articulations to the relative homography...
114
click to vote
ENDM
2008
15 years 22 days ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
85
Voted
GD
2009
Springer
15 years 5 months ago
2009
Springer
We show that each quadrangulation on n vertices has a closed rectangle of influence drawing on the (n − 2) × (n − 2) grid. Further, we present a simple algorithm to obtain a...
110
click to vote
JCT
2007
15 years 17 days ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...