A model to simplify 2D triangle meshes with irregular shapes

DOI10.1016/J.AMC.2010.04.005zbMATH Open1193.65020OpenAlexW2093404963MaRDI QIDQ984322FDOQ984322

Authors: Leandro Tortosa, Jose 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

Recommendations

• Reducing urban concentration using a neural network model
• A new mesh simplification algorithm based on triangle collapses
• scientific article; zbMATH DE number 2036491
• Angle-bounded 2D mesh simplification
• scientific article; zbMATH DE number 1487778

zbMATH Keywords

artificial neural networksnumerical examplestriangulationalgorithm analysisself-organizing systemsGNG3D modelmesh simplifications

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Angle-bounded 2D mesh simplification
• Reducing urban concentration using a neural network model

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

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