Enumerating triangulation paths
From MaRDI portal
Recommendations
- An efficient algorithm for enumeration of triangulations
- Parallel enumeration of triangulations
- Enumerating triangulations by parallel diagonals
- Enumerating pseudo-triangulations in the plane
- scientific article; zbMATH DE number 1741017
- Efficiently enumerating minimal triangulations
- ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
- scientific article; zbMATH DE number 894701
- Enumerating a class of lattice paths
- Lattice path enumeration
Cited in
(12)- Routes enumeration in a Boolean with respect to intersection and nonintersection relations
- An efficient algorithm for enumeration of triangulations
- Counting triangulations and other crossing-free structures approximately
- Enumerating non-crossing minimally rigid frameworks
- Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods
- Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
- scientific article; zbMATH DE number 1372655 (Why is no real title available?)
- Triangle Finding and Listing in CONGEST Networks
- Enumerating triangulations by parallel diagonals
- Bayesian network based multiagent system -- application in e-marketplace
- Flip paths between lattice triangulations
- Amortized efficiency of generating planar paths in convex position
This page was built for publication: Enumerating triangulation paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952967)
