Orbiting triangle method for convex polygon triangulation

DOI10.2298/AADM170829013MzbMath1488.68130MaRDI QIDQ5155721

Predrag V. Krtolica, Sead H. Mašović, Islam A. Elshaarawy, Predrag S. Stanimirović

Publication date: 8 October 2021

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Catalan numbersCatalan triangleconvex polygon triangulation

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)

Related Items (1)

COMPUTING TRIANGULATIONS OF THE CONVEX POLYGON IN PHP/MYSQL ENVIRONMENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting triangulations of balanced subdivisions of convex polygons
• Counting triangulations of some classes of subdivided convex polygons
• A Catalan triangle
• Diagonal flips in triangulations of surfaces
• The dual diameter of triangulations
• Ears of triangulations and Catalan numbers
• Graph of triangulations of a convex polygon and tree of triangulations
• Computing the flip distance between triangulations
• Algorithms for optimal area triangulations of a convex polygon
• Generating strictly binary trees at random based on convex polygon triangulations
• Decomposition of Catalan numbers and convex polygon triangulations
• Minimal Triangulations of Polygonal Domains
• Slicing an ear using prune-and-search
• Counting Arrangements of 1's and -1's

This page was built for publication: Orbiting triangle method for convex polygon triangulation