Triangulating a convex polygon with fewer number of non-standard bars

DOI10.1016/J.TCS.2007.08.011zbMATH Open1143.68066OpenAlexW2002056632MaRDI QIDQ2465634FDOQ2465634

Authors: Wenqiang Dai, M. Ohsaki, Yinfeng Xu, Naoki Katoh 

Publication date: 7 January 2008

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.08.011

Recommendations

• Computing and Combinatorics
• Approximating uniform triangular meshes in polygons.
• scientific article; zbMATH DE number 1696619
• Linear-size nonobtuse triangulation of polygons
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

zbMATH Keywords

triangulationconvex polygonMesh generation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Provably good mesh generation
• Linear-size nonobtuse triangulation of polygons
• Nonobtuse triangulation of polygons
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
• The dissection of a polygon into nearly equilateral triangles
• Minimal Triangulations of Polygonal Domains
• Approximating uniform triangular meshes in polygons.

Cited In (1)

• Computing and Combinatorics

This page was built for publication: Triangulating a convex polygon with fewer number of non-standard bars

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