TOPICS
Search

Regular Triangulation


A regular triangulation of a finite point set P subset R^d is a triangulation of its convex hull obtained by lifting the points to R^(d+1) with assigned real heights and projecting the lower faces of their convex hull. The heights are chosen so that the projected cells are simplices. Regular triangulations are also called coherent triangulations (De Loera et al. 2010).

For each fixed integer r>=2, Allamigeon et al. (2026) proved that the number of regular triangulations of Delta^(n-1)×Delta^(r-1) is n^((r-1)^2n+o(n)) as n->infty, where Delta^j is the j-dimensional simplex.


See also

Triangulation, Tropical Geometry

Explore with Wolfram|Alpha

References

Allamigeon, X.; Chen, Y.; Gaubert, S.; and Goaoc, X. "The Number of Tropical Order Types and Coherent Matching Fields." 29 Oct 2026. https://arxiv.org/abs/2610.40622.De Loera, J. A.; Rambau, J.; and Santos, F. Triangulations: Structures for Algorithms and Applications. Berlin, Germany: Springer-Verlag, 2010. https://doi.org/10.1007/978-3-642-12971-1.

Cite this as:

Weisstein, Eric W. "Regular Triangulation." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/RegularTriangulation.html

Subject classifications