Sciweavers

5019 search results - page 23 / 1004
» On the Reflexivity of Point Sets
Sort
View
DCG
2006
80views more  DCG 2006»
13 years 8 months ago
Lattice Points in Large Borel Sets and Successive Minima
Let B be a Borel set in Ed with volume V (B) = . It is shown that almost all lattices L in Ed contain infinitely many pairwise disjoint d-tuples, that is sets of d linearly indepen...
Iskander Aliev, Peter M. Gruber
DAM
2011
13 years 3 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
DCG
2010
104views more  DCG 2010»
13 years 5 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...
COCOON
2005
Springer
14 years 2 months ago
An Upper Bound on the Number of Rectangulations of a Point Set
Abstract. We consider the number of different ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments,...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
GD
2004
Springer
14 years 1 months ago
Long Alternating Paths in Bicolored Point Sets
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length n + c n log n . We disprove a conjecture of Erd˝o...
Jan Kyncl, János Pach, Géza Tó...