On counting triangulations in \(d\) dimensions

DOI10.1016/0925-7721(93)90005-QzbMath0801.68155WikidataQ127570807 ScholiaQ127570807MaRDI QIDQ1314531

Tamal Krishna Dey

Publication date: 29 November 1994

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

geometric triangulations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

The first higher Stasheff-Tamari orders are quotients of the higher Bruhat orders ⋮ On the number of simplicial complexes in \(\mathbb{R}^ d\) ⋮ New interpretations of the higher Stasheff-Tamari orders ⋮ Quiver combinatorics and triangulations of cyclic polytopes ⋮ Dyck path triangulations and extendability ⋮ On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space ⋮ Higher-dimensional cluster combinatorics and representation theory ⋮ Nakayama-type phenomena in higher Auslander–Reiten theory ⋮ Persistent graphs and cyclic polytope triangulations ⋮ Many triangulated odd-dimensional spheres

Cites Work

• Triangulated n-manifolds are determined by their \([n/2+1\)-skeletons]
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• Many triangulated spheres
• Counting triangle crossings and halving planes
• Crossing-Free Subgraphs
• The Upper Bound Conjecture and Cohen-Macaulay Rings

This page was built for publication: On counting triangulations in \(d\) dimensions