Approximating uniform triangular meshes in polygons.

DOI10.1016/S0304-3975(01)00407-8MaRDI QIDQ1853569zbMATH OpenOpenAlexFDO

Authors Hiromichi Kojima, M. Ohsaki, Franz Aurenhammer, Naoki Katoh, Yinfeng Xu

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

ApproximationDelaunay triangulationTriangular meshUniform mesh

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1696619
• Delaunay Triangular Meshes in Convex Polygons
• scientific article; zbMATH DE number 1786513
• Computing and Combinatorics
• Optimal Triangulation with Steiner Points

Cites work

• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• A Quadratic Time Algorithm for the Minmax Length Triangulation
• Approximation schemes for covering and packing problems in image processing and VLSI
• Clustering to minimize the maximum intercluster distance
• Generalized Delaunay triangulation for planar graphs
• scientific article; zbMATH DE number 1182895 (Why is no real title available?)
• scientific article; zbMATH DE number 1786513 (Why is no real title available?)
• Linear-size nonobtuse triangulation of polygons
• On a Problem of Heilbronn
• Provably good mesh generation
• The NP-completeness column: An ongoing guide
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

Cited in

(8)

• Triangulating a convex polygon with fewer number of non-standard bars
• scientific article; zbMATH DE number 1696619 (Why is no real title available?)
• scientific article; zbMATH DE number 1786513 (Why is no real title available?)
• Meshes preserving minimum feature size
• Optimal Triangulation with Steiner Points
• Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
• Computing and Combinatorics
• An inequality on the edge lengths of triangular meshes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853569)