Approximating uniform triangular meshes in polygons.
type: Item
instance of: scholarly article
title: Approximating uniform triangular meshes in polygons.
zbMATH Open document ID: 1061.68162
DOI: 10.1016/S0304-3975(01)00407-8
author: Hiromichi Kojima
author: M. Ohsaki
author: Franz Aurenhammer
author: Naoki Katoh
author: Yinfeng Xu
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 1857098
zbMATH Keywords: Triangular mesh
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: Uniform mesh
zbMATH Keywords: Approximation
MaRDI profile type: Publication
cites work: TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
cites work: Provably good mesh generation
cites work: Linear-size nonobtuse triangulation of polygons
cites work: A Quadratic Time Algorithm for the Minmax Length Triangulation
cites work: Q4400992
cites work: Clustering to minimize the maximum intercluster distance
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: The NP-completeness column: An ongoing guide
cites work: Q4547807
cites work: Generalized Delaunay triangulation for planar graphs
cites work: On a Problem of Heilbronn
cites work: A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
full work available at URL: s0304-3975(01)00407-8
OpenAlex ID: W2064686450
description: scientific article; zbMATH DE number 1857098