Continuous and Discrete Radius Functions on Voronoi Tessellations and Delaunay MosaicsDiscrete & Computational Geometry - Tập 67 - Trang 811-842 - 2022
Ranita Biswas, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, Morteza Saghafian
The Voronoi tessellation in
$${{{\mathbb {R}}}}^d$$
is defined by locally minimizing the power distance to given weighted points. Symmetrically, the Delaunay mosaic can be defined by locally maximizing the negative power distance to other such points. We prove that the average of the two piecewise...... hiện toàn bộ
On Open and Closed Convex CodesDiscrete & Computational Geometry - Tập 61 Số 2 - Trang 247-270 - 2019
Joshua Cruz, Chad Giusti, Vladimir Itskov, Bill Kronholm
Ehrhart Polynomials of Matroid Polytopes and PolymatroidsDiscrete & Computational Geometry - Tập 42 - Trang 670-702 - 2008
Jesús A. De Loera, David C. Haws, Matthias Köppe
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that, for fixed rank, Ehrhart polynomials of matroid polytopes and polymatroids are computable in polynomial time. The proof relies on the geometry of these polytopes as well as a new refined analysis of the evaluation of Todd polynomials...... hiện toàn bộ
Topological Optimization with Big StepsDiscrete & Computational Geometry - - Trang 1-35 - 2024
Arnur Nigmetov, Dmitriy Morozov
Using persistent homology to guide optimization has emerged as a novel application of topological data analysis. Existing methods treat persistence calculation as a black box and backpropagate gradients only onto the simplices involved in particular pairs. We show how the cycles and chains used in the persistence calculation can be used to prescribe gradients to larger subsets of the domain. In pa...... hiện toàn bộ
Pre-Triangulations and Liftable ComplexesDiscrete & Computational Geometry - Tập 38 - Trang 701-725 - 2007
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl
We introduce the concept of pre-triangulations, a relaxation of triangulations that goes beyond the frequently used concept of pseudo-triangulations. Pre-triangulations turn out to be more natural than pseudo-triangulations in certain cases. We show that pre-triangulations arise in three different contexts: In the characterization of polygonal complexes that are liftable to three-space in a stron...... hiện toàn bộ
Pairwise Balanced Designs with Prescribed Minimum DimensionDiscrete & Computational Geometry - Tập 51 - Trang 485-494 - 2013
Peter J. Dukes, Alan C. H. Ling
The dimension of a linear space is the maximum positive integer d such that any d of its points generate a proper subspace. For a set K of integers at least two, recall that a pairwise balanced design
$\operatorname{PBD}(v,K)$
is a linear space on v points whose lines (or blocks) have sizes belonging to ...... hiện toàn bộ
ForewordDiscrete & Computational Geometry - Tập 39 - Trang 1-2 - 2007
Jacob E. Goodman, János Pach, Richard Pollack
The Number of k -Faces of a Simple d -PolytopeDiscrete & Computational Geometry - Tập 21 - Trang 1-16 - 1999
A. Björner, S. Linusson
Consider the question: Given integers 0 \le
k N(d,k) the answer is yes if and only if {G(d,k)} divides n . Furthermore, a formula for G(d,k) is given, showing that, e.g., G(d,k)=1 if
...... hiện toàn bộ