On the minimality of polygon triangulation

DOI10.1007/BF01933206zbMath0714.68037OpenAlexW2059339350MaRDI QIDQ751276

Chiuyuan Chen, Ruei-Chuan Chang

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933206

zbMATH Keywords

minimum triangulation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Descriptive geometry (51N05)

Related Items

MINIMUM NUMBER OF PIECES IN A CONVEX PARTITION OF A POLYGONAL DOMAIN ⋮ On convex partitions of polygonal regions ⋮ Polygon Area Decomposition for Multiple-Robot Workspace Division

Cites Work

• Unnamed Item
• Visibility and intersection problems in plane geometry
• Triangulating a simple polygon
• Triangulating Simple Polygons and Equivalent Problems
• Polygon triangulation: Efficiency and minimality
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

This page was built for publication: On the minimality of polygon triangulation