Algorithms for investigating optimality of cone triangulation for a polyhedron
We show that whenever the -dimensional Minkowski content of a subset exists and is finite and positive, then the “S-content” defined analogously as the Minkowski content, but with volume replaced by surface area, exists as well and equals the Minkowski content. As a corollary, we obtain the almost sure asymptotic behaviour of the surface area of the Wiener sausage in , .
Let be a strictly convex separable Banach space of dimension at least 2. Let K() be the space of all nonempty compact convex subsets of endowed with the Hausdorff distance. Denote by the set of all X ∈ K() such that the farthest distance mapping is multivalued on a dense subset of . It is proved that is a residual dense subset of K().
For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate from algorithmics, discrete geometry and combinatorics on words.
The main goal of this paper is to provide an alternative proof of the following theorem of Petty: in a normed space of dimension at least three, every 3-element equilateral set can be extended to a 4-element equilateral set. Our approach is based on the result of Kramer and Németh about inscribing a simplex into a convex body. To prove the theorem of Petty, we shall also establish that for any three points in a normed plane, forming an equilateral triangle of side p, there exists a fourth point,...