Computing bushy and thin triangulations

DOI10.1016/0925-7721(91)90003-WzbMath0764.68180MaRDI QIDQ1190294

Thomas C. Shermer

Publication date: 27 September 1992

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

dual treetriangulation of a simple polygon

Mathematics Subject Classification ID

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

Related Items (2)

The dual diameter of triangulations ⋮ On polyhedra induced by point sets in space

Cites Work

• Unnamed Item
• Triangulating a simple polygon
• A new linear algorithm for triangulating monotone polygons
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• Minimal Triangulations of Polygonal Domains
• A linear algorithm for computing the visibility polygon from a point
• Anthropomorphic Polygons

This page was built for publication: Computing bushy and thin triangulations