Absolutely linear relations.
Absolutely linear relations (Short Communication).
Acknowledgment of Priority Concerning: Polytopes that Fill R" and Scissors Congruence.
Addition and subtraction of homothety classes of convex sets.
Affine perimeter and limit shape.
Affine-regular hexagons of extreme areas inscribed in a centrally symmetric convex body.
Aire de l'Ellipse déterminée par cinq points.
Alexander duality in subdivisions of Lawrence polytopes.
Alexandrov’s theorem, weighted Delaunay triangulations, and mixed volumes
We present a constructive proof of Alexandrov’s theorem on the existence of a convex polytope with a given metric on the boundary. The polytope is obtained by deforming certain generalized convex polytopes with the given boundary. We study the space of generalized convex polytopes and discover a connection with weighted Delaunay triangulations of polyhedral surfaces. The existence of the deformation follows from the non-degeneracy of the Hessian of the total scalar curvature of generalized convex...
Algebraic and geometric approach to the classification of semispaces.
Algebraic shifting and sequentially Cohen-Macaulay simplicial complexes.
Algorithmen zur Unimodalitötsbestimmung einfacher Polygone
Algorithms for investigating optimality of cone triangulation for a polyhedron
Algorithms for Triangulating Polyhedra Into a Small Number of Tethraedra
Almost sure asymptotic behaviour of the -neighbourhood surface area of Brownian paths
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 , .
Ambiguous loci of the farthest distance mapping from compact convex sets
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().
Ambiguous Loci of the Metric Projection Onto Compact Starshaped Sets in a Banach Space.
Ammann Bars and Quasicrystals.
An Algorithm for a Simple Construction of Suboptimal Digital Convex Polygons
An algorithm for deciding if a polyomino tiles the plane
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.