The following pages link to (Q4331201):
Displaying 26 items.
- Counting triangulations of some classes of subdivided convex polygons (Q518180) (← links)
- The enumeration of akempic triangulations (Q1065015) (← links)
- Generating and counting triangular systems (Q1092055) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- On counting triangulations in \(d\) dimensions (Q1314531) (← links)
- Parallel enumeration of triangulations (Q1658781) (← links)
- New counts for the number of triangulations of cyclic polytopes (Q1662246) (← links)
- Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
- Counting polytopes via the Radon complex (Q1826858) (← links)
- An efficient algorithm for enumeration of triangulations (Q1862130) (← links)
- Graph of triangulations of a convex polygon and tree of triangulations (Q1961385) (← links)
- Persistent graphs and cyclic polytope triangulations (Q2043765) (← links)
- Pre-triangulations and liftable complexes (Q2471725) (← links)
- (Q3801582) (← links)
- Enumeration of Almost-Convex Polygons on the Square Lattice (Q4019376) (← links)
- REGULAR ENUMERATION OF GRID POINTS IN A CONVEX POLYGON (Q4294717) (← links)
- A POLYNOMIAL ALGORITHM FOR ENUMERATING ALL VERTICES OF A BASE POLYHEDRON (Q4366145) (← links)
- (Q4383278) (← links)
- (Q4561135) (← links)
- (Q5150385) (← links)
- Enumeration of integral tetrahedra (Q5387533) (← links)
- Geometric bistellar flips: the setting, the context and a construction (Q5491019) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- Enumerating triangulation paths (Q5952967) (← links)
- Enumeration of corner polyhedra and 3-connected Schnyder labelings (Q6046226) (← links)
- Enumeration of corner polyhedra and 3-connected Schnyder labelings (Q6161699) (← links)
