Approximating uniform triangular meshes in polygons.

DOI10.1016/S0304-3975(01)00407-8zbMath1061.68162OpenAlexW2064686450MaRDI QIDQ1853569

Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu, Franz Aurenhammer, Naoki Katoh

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00407-8

zbMATH Keywords

Delaunay triangulationApproximationTriangular meshUniform mesh

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

An inequality on the edge lengths of triangular meshes ⋮ Triangulating a convex polygon with fewer number of non-standard bars

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• Generalized Delaunay triangulation for planar graphs
• Provably good mesh generation
• Linear-size nonobtuse triangulation of polygons
• Approximation schemes for covering and packing problems in image processing and VLSI
• A Quadratic Time Algorithm for the Minmax Length Triangulation
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• On a Problem of Heilbronn
• The NP-completeness column: An ongoing guide

This page was built for publication: Approximating uniform triangular meshes in polygons.