Linear-size nonobtuse triangulation of polygons
type: Item
instance of: scholarly article
title: Linear-size nonobtuse triangulation of polygons
zbMATH Open document ID: 0841.68118
DOI: 10.1007/BF02570715
author: Yanyan Li
published in: Discrete \& Computational Geometry
publication date: 1996-07-14T00:00:00Z
full work available at URL: https://eudml.org/doc/131411
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 842059
zbMATH Keywords: triangulation
zbMATH Keywords: Steiner points
describes a project that uses: Matlab
describes a project that uses: DELAUNDO
MaRDI profile type: Publication
cites work: Nonobtuse triangulation of polygons
cites work: Decomposable searching problems I. Static-to-dynamic transformation
cites work: Q4886048
cites work: TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
cites work: POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS
cites work: Provably good mesh generation
cites work: Q3273607
cites work: Incremental topological flipping works for regular triangulations
cites work: An upper bound for conforming Delaunay triangulations
cites work: Faster Circle Packing with Application to Nonobtuse Triangulation
cites work: A sweepline algorithm for Voronoi diagrams
cites work: Constructing the Voronoi diagram of a set of line segments in parallel
cites work: Q3992847
cites work: Q3140404
cites work: A data structure for dynamic trees
cites work: Q4127946
description: scientific article; zbMATH DE number 842059