On counting triangulations in d dimensions

DOI10.1016/0925-7721(93)90005-QzbMATH Open0801.68155WikidataQ127570807 ScholiaQ127570807MaRDI QIDQ1314531FDOQ1314531

Authors: Tamal K. Dey 

Publication date: 29 November 1994

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

Recommendations

• On the size of higher-dimensional triangulations
• A better upper bound on the number of triangulations of a planar point set
• scientific article; zbMATH DE number 1741017
• On the number of simplicial complexes in \(\mathbb{R}^ d\)

zbMATH Keywords

geometric triangulations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (32)

• Trees of nuclei and bounds on the number of triangulations of the 3-ball
• On the Delone triangulation numbers
• Many triangulated odd-dimensional spheres
• Higher-dimensional cluster combinatorics and representation theory
• Bijective counting of Kreweras walks and loopless triangulations
• On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space
• Many triangulated spheres
• A new perspective on \(k\)-triangulations
• On the number of walks in a triangular domain
• Asymptotic number of triangulations with vertices in \(\mathbb{Z}^2\)
• The Number of Triangulations on Planar Point Sets
• On the Number of Higher Order Delaunay Triangulations
• On the size of higher-dimensional triangulations
• Extremal problems for geometric hypergraphs
• Title not available (Why is that?)
• Nakayama-type phenomena in higher Auslander-Reiten theory
• The number of geometric bistellar neighbors of a triangulation
• The first higher Stasheff-Tamari orders are quotients of the higher Bruhat orders
• New interpretations of the higher Stasheff-Tamari orders
• Dyck path triangulations and extendability
• Title not available (Why is that?)
• On the number of simplicial complexes in \(\mathbb{R}^ d\)
• Persistent graphs and cyclic polytope triangulations
• A Cheeger-type exponential bound for the number of triangulated manifolds
• Title not available (Why is that?)
• Quiver combinatorics and triangulations of cyclic polytopes
• Number of triangular packings of a marked graph on a projective plane
• The enumeration of akempic triangulations
• New counts for the number of triangulations of cyclic polytopes
• Title not available (Why is that?)
• Counting triangulations of some classes of subdivided convex polygons
• Counting triangulations and other crossing-free structures approximately

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314531)