Sciweavers

999 search results - page 32 / 200
» Finding shapes in a set of points
Sort
View
70
Voted
CSC
2006
14 years 11 months ago
Minimal Enclosing Circle and Two and Three Point Partition of a Plane
Partitions of a plane, based on two or three of its points, are introduced. The study of these partitions is applied to finding the minimal enclosing circle (MEC) for a set S of n...
Felix Friedman
DASFAA
2011
IEEE
197views Database» more  DASFAA 2011»
14 years 1 months ago
Finding the Sites with Best Accessibilities to Amenities
Abstract. Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as s...
Qianlu Lin, Chuan Xiao, Muhammad Aamir Cheema, Wei...
ECCV
2008
Springer
15 years 11 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
Neeraj Kumar, Li Zhang, Shree K. Nayar
ICPR
2008
IEEE
15 years 4 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
CVPR
2004
IEEE
15 years 11 months ago
Reconstructing Open Surfaces from Unorganized Data Points
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
Jan Erik Solem, Anders Heyden