The generation of webs by Delaunay refinement. Paper from the 30th Brazilian mathematics colloquium -- 30^ o Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 26--31, 2015

MaRDI QIDQ5500593zbMATH OpenFDO

Authors Marcelo Siqueira, Afonso Paiva, Paulo Pagliosa

Publication date 7 August 2015

Full work available at URL http://impa.br/wp-content/uploads/2017/04/30CBM_06.pdf

zbMATH Keywords

Delaunay triangulationgeometric predicatesGraham scan algorithmmesh generationRuppert's algorithm

Mathematics Subject Classification ID

Affine analytic geometry (51N10) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Delaunay mesh generation.
• scientific article; zbMATH DE number 1183273
• Mesh generation. Application to finite elements. Transl. from the 1999 French original by the authors
• Triangulations and applications
• Geometry and topology for mesh generation

Cited in

(1)

• scientific article; zbMATH DE number 5605312 (Why is no real title available?)

This page was built for publication: The generation of webs by Delaunay refinement. Paper from the 30th Brazilian mathematics colloquium -- 30\(^{\text o}\) Colóquio Brasileiro de Matemática, Rio de Janeiro, Brazil, July 26--31, 2015

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