Meshes preserving minimum feature size

DOI10.1007/978-3-642-34191-5_25MaRDI QIDQ4899286zbMATH OpenOpenAlexFDO

Authors Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmović, John Iacono

Publication date 7 January 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/86202

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 437532
• A 2D advancing-front Delaunay mesh refinement algorithm
• Delaunay refinement algorithms for triangular mesh generation
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Approximating uniform triangular meshes in polygons.

Cites work

• scientific article; zbMATH DE number 437532 (Why is no real title available?)
• scientific article; zbMATH DE number 1229395 (Why is no real title available?)
• Meshes preserving minimum feature size
• Nice point sets can have nasty Delaunay triangulations
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES

Cited in

(2)

• Dissection with the fewest pieces is hard, even to approximate
• Meshes preserving minimum feature size

This page was built for publication: Meshes preserving minimum feature size

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