A non-recursive algorithm for polygon triangulation

DOI10.2298/YJOR0301061SMaRDI QIDQ4928156zbMATH OpenOpenAlexFDO

Authors Predrag S. Stanimirović, Predrag Krtolica, Rade Stanojević

Publication date 10 June 2013

Published in Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/yjor0301061s

zbMATH Keywords

context-free grammarconvex polygon triangulationreverse Polish notation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 2010154
• scientific article; zbMATH DE number 515326
• A new linear algorithm for triangulating monotone polygons
• Publication:3198929
• Linear-size nonobtuse triangulation of polygons

Cited in

(10)

• Nonobtuse triangulation of polygons
• Computing triangulations of the convex polygon in PHP/MySQL environment
• scientific article; zbMATH DE number 3932438 (Why is no real title available?)
• A heuristic triangulation algorithm
• An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
• scientific article; zbMATH DE number 2010154 (Why is no real title available?)
• A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
• Orbiting triangle method for convex polygon triangulation
• Implementation of the convex polygon triangulation algorithm
• An algorithm to find polygon similarity

This page was built for publication: A non-recursive algorithm for polygon triangulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928156)