42 search results - page 7 / 9 » Random triangulations of planar point sets |
IVC
2000
13 years 7 months ago
2000
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
ICCV
2009
IEEE
15 years 18 days ago
2009
IEEE
We present a novel multi-view stereo method designed
for image-based rendering that generates piecewise planar
depth maps from an unordered collection of photographs.
First a di...
3DGIS
2006
Springer
14 years 1 months ago
2006
Springer
The modelling or reconstruction of buildings has two aspects – on the one hand we need a data structure and the associated geometric information, and on the other hand we need a...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...