450 search results - page 30 / 90 » Quadrangulations of Planar Sets |
176
click to vote
DAM
2011
15 years 1 months ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
139
click to vote
UC
2009
Springer
16 years 18 days ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
156
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We study and compare two novel embedding methods for segmenting feature points of piece-wise planar structures from two (uncalibrated) perspective images. We show that a set of di...
155
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
A mixed hypergraph is a triple H = (V, C, D) where V is the vertex set and C and D are families of subsets of V , the C-edges and D-edges, respectively. A k-colouring of H is a ma...
167
click to vote
ACIVS
2006
Springer
15 years 9 months ago
2006
Springer
Most approaches to camera motion estimation from image sequences require matching the projections of at least 4 non-coplanar points in the scene. The case of points lying on a plan...