7351 search results - page 208 / 1471 » Segmenting Point Sets |
145
click to vote
IJCV
2007
15 years 6 months ago
2007
Abstract. We address the problem of finding the correspondences of two point sets in 3D undergoing a rigid transformation. Using these correspondences the motion between the two s...
203
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
148
click to vote
CCCG
2010
15 years 8 months ago
2010
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
161
click to vote
CCCG
2006
15 years 8 months ago
2006
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
165
click to vote
BMVC
1997
15 years 8 months ago
1997
The least squares method is the most commonly used technique for fitting an ellipse through a set of points. However, it has a low breakdown point, which means that it performs p...