7351 search results - page 187 / 1471 » Segmenting Point Sets |
153
click to vote
DAGSTUHL
2004
15 years 6 months ago
2004
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
146
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Finding correspondences between feature points is one
of the most relevant problems in the whole set of visual
tasks. In this paper we address the problem of matching
a feature ...
146
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...
128
Voted
CCCG
2001
15 years 6 months ago
2001
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...
126
click to vote
CGF
2000
15 years 4 months ago
2000
We present an interactive system for the generation of high quality triangle meshes that allows us to handle hybrid geometry (point clouds, polygons, ...) as input data. In order ...