A non-recursive algorithm for polygon triangulation
In this paper an algorithm for the convex polygon triangulation based on the reverse Polish notation is proposed. The formal grammar method is used as the starting point in the investigation. This idea is "translated" to the arithmetic expression field enabling application of the reverse P...
Main Authors: | Stanimirović Predrag S., Krtolica Predrag V., Stanojević Rade |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Belgrade
2003-01-01
|
Series: | Yugoslav Journal of Operations Research |
Subjects: | |
Online Access: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2003/0354-02430301061S.pdf |
Similar Items
-
K-set Polygons and Centroid Triangulations
by: El Oraiby, Wael
Published: (2009) -
Triangulation Algorithm Based on Empty Convex Set Condition
by: Klyachin Vladimir Aleksandrovich
Published: (2015-11-01) -
Application of Delaunay Triangulation and Catalan Objects in Steganography
by: Faruk Selimović, et al.
Published: (2021-05-01) -
K-set Polygons and Centroid Triangulations
by: El Oraiby, Wael
Published: (2009) -
Real-time generation of nature from polygonal data
by: Hännestrand, Filip
Published: (2018)