7351 search results - page 167 / 1471 » Segmenting Point Sets |
118
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
For every k > 3, we give a construction of planar point sets with many collinear k-tuples and no collinear (k + 1)-tuples.
142
click to vote
CAD
2008
Springer
15 years 4 months ago
2008
Springer
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
156
click to vote
CGI
2009
IEEE
15 years 8 months ago
2009
IEEE
Two dimensional point data can be considered one of the most basic, yet one of the most ubiquitous data types arising in a wide variety of applications. The basic scatter plot app...
176
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
We give the first fully compressed representation of a set of m points on an n
183
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Abstract. We propose a variational framework for the integration multiple competing shape priors into level set based segmentation schemes. By optimizing an appropriate cost functi...