A model to simplify 2D triangle meshes with irregular shapes

DOI10.1016/j.amc.2010.04.005zbMath1193.65020OpenAlexW2093404963MaRDI QIDQ984322

Leandro Tortosa, José-Francisco Vicent, Antonio Zamora

Publication date: 19 July 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.04.005

zbMATH Keywords

triangulationnumerical examplesartificial neural networksalgorithm analysisself-organizing systemsGNG3D modelmesh simplifications

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing minimum-interference networks
• Constrained CVT meshes and a comparison of triangular mesh generators
• Flips in planar graphs
• Triangulating input-constrained planar point sets
• Self-organized formation of topologically correct feature maps
• DeWall: a fast divide and conquer Delaunay triangulation algorithm in \(E^d\).
• Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
• Transforming pseudo-triangulations
• Analysis and efficiency of the GNG3D algorithm for mesh simplification
• Centroidal Voronoi Tessellations: Applications and Algorithms

This page was built for publication: A model to simplify 2D triangle meshes with irregular shapes