Computing bushy and thin triangulations
type: Item
instance of: scholarly article
title: Computing bushy and thin triangulations
zbMATH Open document ID: 0764.68180
DOI: 10.1016/0925-7721(91)90003-W
published in: Computational Geometry
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 57271
zbMATH Keywords: triangulation of a simple polygon
zbMATH Keywords: dual tree
author: Thomas C. Shermer
MaRDI profile type: Publication
cites work: A linear algorithm for computing the visibility polygon from a point
cites work: Triangulating a simple polygon
cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi
cites work: Minimal Triangulations of Polygonal Domains
cites work: A new linear algorithm for triangulating monotone polygons
cites work: Anthropomorphic Polygons
cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
cites work: Q3704927
Recommended article: Q4550963
Recommended article: Efficient triangulations and boundary slopes
Recommended article: Triangulations and simplicial methods
Recommended article: Computing correct Delaunay triangulations
Recommended article: Triangulation and shape-complexity
Recommended article: Computing a minimum weight triangulation of a sparse point set
Recommended article: Exact computation of Delaunay and power triangulations
Recommended article: Q5448995
Recommended article: On computation of triangulation with piecewise linearity and separability
description: scientific article; zbMATH DE number 57271