ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
From MaRDI portal
Publication:4818572
DOI10.1142/S0218195902000980zbMath1045.05006MaRDI QIDQ4818572
Tomonari Masada, Keiko Imai, Fumihiko Takeuchi, Hiroshi Imai
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195902000980
05A15: Exact enumeration problems, generating functions
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Related Items
The Newton polytope of the discriminant of a quaternary cubic form, Parallel enumeration of triangulations, Toric varieties and Gröbner bases: the complete \(\mathbb{Q}\)-factorial case, AN ORACLE-BASED, OUTPUT-SENSITIVE ALGORITHM FOR PROJECTIONS OF RESULTANT POLYTOPES
Cites Work
- Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
- Constructions and complexity of secondary polytopes
- Construction of three-dimensional Delaunay triangulations using local transformations
- The number of faces of a simplicial convex polytope
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Minimal simplicial dissections and triangulations of convex 3-polytopes
- Gröbner bases of toric varieties
- Gröbner bases and triangulations of the second hypersimplex
- Incremental topological flipping works for regular triangulations
- Nonregular triangulations of products of simplices
- Reverse search for enumeration
- Extremal Properties for Dissections of Convex 3-Polytopes
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- A New Algorithm for Generating All the Maximal Independent Sets
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Isomorph-Free Exhaustive Generation
- Three-Dimensional Triangulations from Local Transformations
- Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
