Polygon triangulation: Efficiency and minimality

DOI10.1016/0196-6774(86)90005-2zbMath0605.68062OpenAlexW2015568644MaRDI QIDQ3742737

Takao Asano, Tetsuo Asano, Ron Yair Pinter

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90005-2

zbMATH Keywords

holespolynomial time algorithmminimum-number triangulationspartitioning a polygonal region

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

REGION INTERVISIBILITY IN TERRAINS ⋮ On the minimality of polygon triangulation

This page was built for publication: Polygon triangulation: Efficiency and minimality