You are in:Home/Publications/Orbiting Triangle Method for Convex Polygon Triangulation

Dr. Islam ElShaarawy :: Publications:

Orbiting Triangle Method for Convex Polygon Triangulation
Authors: Sead H. Mašović, Islam A. Elshaarawy, Predrag S. Stanimirović, Predrag V. Krtolica
Year: 2018
Keywords: Not Available
Journal: Applicable Analysis and Discrete Mathematics
Volume: 12
Issue: 2
Pages: 439-454
Publisher: Not Available
Local/International: International
Paper Link:
Full paper Not Available
Supplementary materials Not Available

Finding all possible triangulations of convex polygon is a highly time and memory space consuming combinatorial problem. Therefore, it is very important to develop algorithms for generating triangulations as efficiently as possible. This paper presents a new method for generating triangulations of a convex polygon, called Orbiting triangle method (OTM). The method is based on using the set of (n-1)-gon triangulations during the set of n-gon triangulations creation. The main feature of the OTM algorithm is the use of the Catalan triangle to identify valid triangulations, so that the algorithm spends almost no time to eliminate duplicates. In this way, the method possesses small complexity and saves the computational time required for detecting and eliminating duplicates.

Google ScholarAcdemia.eduResearch GateLinkedinFacebookTwitterGoogle PlusYoutubeWordpressInstagramMendeleyZoteroEvernoteORCIDScopus