scientific article; zbMATH DE number 1182907
Consider a finite point configuration \(V \subset R^d\), where the convex hull of \(V\) is a convex \(d\)-polytope. A subdivision of \(V\) is a finite collection of \(d\)-polytopes \(\{P_1,\dots,P_k\}\) such that their vertices are elements of \(V\), \(\text{conv} (V)\) is the union of the \(P_i\), and the intersection of any pair \(P_i \cap P_j\) is either empty or a common face. A triangulation of \(V\) is a subdivision for which all \(P_i\) are simplices. This nice survey article contains all the basic definitions and fundamental results of the theory of triangulations and subdivisions of point configurations. For the entire collection see [Zbl 0890.52001].
- Asymptotically efficient triangulations of the d-cube
- A control problem for affine dynamical systems on a full-dimensional polytope.
- Hilbert-Kunz density function and asymptotic Hilbert-Kunz multiplicity for projective toric varieties
- Flow functions, control flow functions, and the reach control problem
- Local level set method in high dimension and codimension
- The polytope of all triangulations of a point configuration
- Explicit convex and concave envelopes through polyhedral subdivisions
- On subdivision posets of cyclic polytopes
- Minimal flag triangulations of lower-dimensional manifolds
- Bracketing numbers of convex and m-monotone functions on polytopes
- Random lattice triangulations: structure and algorithms
- The Bogomolov conjecture for totally degenerate abelian varieties
- The max-flow min-cut property of two-dimensional affine convex geometries
- Non-connected toric Hilbert schemes
- Ehrhart polynomials of cyclic polytopes
- Elementary moves on triangulations
- Effective lattice point counting in rational convex polytopes
- Root polytopes, triangulations, and the subdivision algebra, II
- On f-vectors of pyramidal triangulations of point configurations
- Decomposition algorithm for the single machine scheduling polytope
- Existence of unimodular triangulations -- positive results
- Assymptotically efficient triangulations of the d-cube∗
- Geodesic ideal triangulations exist virtually
- Planar point sets with large minimum convex decompositions
- scientific article; zbMATH DE number 3911182 (Why is no real title available?)
- scientific article; zbMATH DE number 4011347 (Why is no real title available?)
- scientific article; zbMATH DE number 17657 (Why is no real title available?)
- Division point measures resulting from triangle subdivisions
- Effective and big divisors on a projective symmetric variety
- What is known about unit cubes
- A Euclid style algorithm for MacMahon's partition analysis
- Subdivision of Sets in Rk by the Help of a Regular Simplex.
- 2-toroids and their 3-triangulation
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
- Counting triangulations of some classes of subdivided convex polygons
- Finding a fully mixed cell in a mixed subdivision of polytopes
- Noncrossing partitions and the shard intersection order
- The Baues conjecture in corank 3
- On the refinements of a polyhedral subdivision
- On the facets of the secondary polytope
- Weakly regular subdivisions
- Coloring zonotopal quadrangulations of the projective space
- On Lipschitz cohomology of aspherical manifolds
- Polarizations of Artin monomial ideals
- Subdivisions from primal and dual cones and polytopes
- On the log-concavity of Hilbert series of Veronese subrings and Ehrhart series
- Irrational proofs for three theorems of Stanley
- Quadratic Gröbner bases for smooth \(3\times 3\) transportation polytopes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401004)
