5019 search results - page 53 / 1004 » On the Reflexivity of Point Sets |
209
click to vote
ORL
2011
14 years 9 months ago
2011
We show that half-integral polytopes obtained as the convex hull of a random set of half-integral points of the 0/1 cube have rank as high as Ω(log n/ log log n) with positive pr...
179
click to vote
FSTTCS
2007
Springer
16 years 14 days ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
145
click to vote
IROS
2006
IEEE
16 years 9 days ago
2006
IEEE
- The ICP (Iterative Closest Point) algorithm remains a very popular method for the registration of 3D data sets, when an initial guess of the relative pose between them is known. ...
147
click to vote
MP
2008
15 years 6 months ago
2008
Abstract. We attempt a broad exploration of properties and connections between the symmetry function of a convex set S IRn and other arenas of convexity including convex functions...
163
click to vote
JMLR
2011
15 years 1 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...