Sciweavers

7351 search results - page 48 / 1471
» Segmenting Point Sets
Sort
View
COCOA
2010
Springer
13 years 8 months ago
The Union of Colorful Simplices Spanned by a Colored Point Set
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
André Schulz, Csaba D. Tóth
CCCG
2010
13 years 11 months ago
Finding monochromatic l-shapes in bichromatic point sets
Given a set R of red points and a set B of blue points in the plane of total size n, we study the problem of determining all angles for which there exists an L-shape containing al...
Farnaz Sheikhi, Mark de Berg, Ali Mohades, Mansoor...
SIAMDM
2010
123views more  SIAMDM 2010»
13 years 8 months ago
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...
CVPR
1996
IEEE
14 years 12 months ago
Determining Correspondences and Rigid Motion of 3-D Point Sets with Missing Data
This paper addresses the general 3-D rigid motion problem, where the point correspondences and the motion parameters between two sets of 3-D points are to be recovered. The existe...
Xiaoguang Wang, Yong-Qing Cheng, Robert T. Collins...
ICCV
2005
IEEE
14 years 12 months ago
A Robust Algorithm for Point Set Registration Using Mixture of Gaussians
This paper proposes a novel and robust approach to the point set registration problem in the presence of large amounts of noise and outliers. Each of the point sets is represented...
Bing Jian, Baba C. Vemuri