Large simplices determined by finite point sets
نویسندگان
چکیده
Given a set P of n points in R, let d1 > d2 > . . . denote all distinct inter-point distances generated by point pairs in P . It was shown by Schur, Martini, Perles, and Kupitz that there is at most one d-dimensional regular simplex of edge length d1 whose every vertex belongs to P . We extend this result by showing that for any k the number of d-dimensional regular simplices of edge length dk generated by the points of P is bounded from above by a constant that depends only on d and k.
منابع مشابه
Empty Monochromatic Simplices
Let S be a k-colored (finite) set of n points in R, d ≥ 3, in general position, that is, no (d+1) points of S lie in a common (d−1)-dimensional hyperplane. We count the number of empty monochromatic d-simplices determined by S, that is, simplices which have only points from one color class of S as vertices and no points of S in their interior. For 3 ≤ k ≤ d we provide a lower bound of Ω(nd−k+1+...
متن کاملUltrametric sets in Euclidean point spaces
Finite sets S of points in a Euclidean space the mutual distances of which satisfy the ultrametric inequality (A;B) maxf (A;C); (C;B)g for all points in S are investigated and geometrically characterized. Inspired by results on ultrametric matrices and previous results on simplices, connections with so-called centered metric trees as well as with strongly isosceles right simplices are found. AM...
متن کاملOn the optimality of functionals over triangulations of Delaunay sets
In this short paper we consider the functional density on sets of uniformly bounded triangulations with fixed sets of vertices. We prove that if a functional attains its minimum on the Delaunay triangulation for every finite set in the plane, then for infinite sets the density of this functional attains its minimum also on the Delaunay triangulations. A Delaunay set in E is a set of points X fo...
متن کاملTriangulations Of Point Sets Applications, Structures, Algorithms
1 When solving a difficult problem it is a natural idea to decompose complicated objects into smaller, easy-to-handle pieces. In this book we study such decomposi-tions: triangulations of point sets. We will look at trian-gulations from many different points of view. We explore their combinatorial and geometric properties as well as some algorithmic issues arising along the way. This first chap...
متن کاملBases in Systems of Simplices and Chambers
We consider a finite set E of points in the n-dimensional affine space and two sets of objects that are generated by the set E: the system Σ of ndimensional simplices with vertices in E and the system Γ of chambers. The incidence matrix A =‖ aσ,γ ‖, σ ∈ Σ, γ ∈ Γ, induces the notion of linear independence among simplices (and among chambers). We present an algorithm of construction of bases of s...
متن کامل