450 search results - page 30 / 90 » Quadrangulations of Planar Sets |
DAM
2011
13 years 4 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 ...
UC
2009
Springer
14 years 3 months 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...
CVPR
2005
IEEE
14 years 11 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...
COMBINATORICS
2000
13 years 9 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...
ACIVS
2006
Springer
14 years 26 days 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...