Abstract | ||
---|---|---|
The paper deals with geometric constraints on Delaunay polytopes, arising from hypermetric inequalities with origins in lattice theory. In some cases the constraints are sufficient to uniquely define a Delaunay polytope, a situation of primary interest in combinatorial rigidity; and the configuration space of underconstrained Delaunay polytopes defines a face of the hypermetric cone. Symbolic algorithms and computations algorithms form the basis of the paper's results and illustrative examples. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1016/j.jsc.2016.01.009 | Journal of Symbolic Computation |
Keywords | Field | DocType |
Delaunay polytopes,Central symmetry,Dual description,Metric cone,Cut polytope,Hypermetric | Discrete mathematics,Combinatorics,Vertex (geometry),Lattice (order),Generalization,Complete theory,Polytope,Mathematics,Delaunay triangulation,Configuration space,Computation | Journal |
Volume | ISSN | Citations |
88 | 0747-7171 | 0 |
PageRank | References | Authors |
0.34 | 9 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Michel Deza | 1 | 281 | 68.20 |
Mathieu Dutour Sikiric | 2 | 18 | 4.50 |