1348 search results - page 164 / 270 » Matching planar maps |
185
click to vote
SMI
2005
IEEE
15 years 12 months ago
2005
IEEE
Traditional approaches for modeling a closed manifold surface with either regular tensor-product or triangular splines (defined over an open planar domain) require decomposing th...
210
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
182
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
173
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper extends the traditional binocular stereo problem into the spacetime domain, in which a pair of video streams is matched simultaneously instead of matching pairs of imag...
159
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a real-time method for detecting deformable surfaces, with no need whatsoever for a priori pose knowledge. Our method starts from a set of wide baseline point matches b...