Orbiting triangle method for convex polygon triangulation
From MaRDI portal
Recommendations
Cites work
- A Catalan triangle
- Algorithms for optimal area triangulations of a convex polygon
- Computing the flip distance between triangulations
- Counting Arrangements of 1's and -1's
- Counting triangulations of balanced subdivisions of convex polygons
- Counting triangulations of some classes of subdivided convex polygons
- Decomposition of Catalan numbers and convex polygon triangulations
- Diagonal flips in triangulations of surfaces
- Ears of triangulations and Catalan numbers
- Generating strictly binary trees at random based on convex polygon triangulations
- Graph of triangulations of a convex polygon and tree of triangulations
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1409186 (Why is no real title available?)
- scientific article; zbMATH DE number 5497553 (Why is no real title available?)
- Implementation of the convex polygon triangulation algorithm
- Minimal Triangulations of Polygonal Domains
- Slicing an ear using prune-and-search
- The dual diameter of triangulations
- Triangulation of convex polygon with storage support
Cited in
(2)
This page was built for publication: Orbiting triangle method for convex polygon triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155721)