This work presents a new efficient array-based algorithm for adaptive mesh refinement capable of interactively generating millions of triangles. The new refinement algorithm satisfies important topological mesh properties, e.g., vertex valence control and a good mesh gradation. Furthermore, all local topological modifications of the triangle mesh are based on Stellar operators implemented on top of the Corner-Table topological data structure. This paper also shows that the proposed implementation provides a good balance in the trade-off between memory and processing time.
Описание
ARTMe: a new array-based algorithm for Adaptive Refinement of Triangle Meshes | SpringerLink
%0 Journal Article
%1 Coêlho2018
%A Coêlho, Jéferson
%A Gattass, Marcelo
%A Lopes, Hélio
%D 2018
%J Engineering with Computers
%K 2018 data-structure geometry mesh springer topology
%R 10.1007/s00366-018-0579-5
%T ARTMe: a new array-based algorithm for Adaptive Refinement of Triangle Meshes
%U https://doi.org/10.1007/s00366-018-0579-5
%X This work presents a new efficient array-based algorithm for adaptive mesh refinement capable of interactively generating millions of triangles. The new refinement algorithm satisfies important topological mesh properties, e.g., vertex valence control and a good mesh gradation. Furthermore, all local topological modifications of the triangle mesh are based on Stellar operators implemented on top of the Corner-Table topological data structure. This paper also shows that the proposed implementation provides a good balance in the trade-off between memory and processing time.
@article{Coêlho2018,
abstract = {This work presents a new efficient array-based algorithm for adaptive mesh refinement capable of interactively generating millions of triangles. The new refinement algorithm satisfies important topological mesh properties, e.g., vertex valence control and a good mesh gradation. Furthermore, all local topological modifications of the triangle mesh are based on Stellar operators implemented on top of the Corner-Table topological data structure. This paper also shows that the proposed implementation provides a good balance in the trade-off between memory and processing time.},
added-at = {2018-06-08T16:13:10.000+0200},
author = {Co{\^e}lho, J{\'e}ferson and Gattass, Marcelo and Lopes, H{\'e}lio},
biburl = {https://www.bibsonomy.org/bibtex/2231e8143e434db227ea011444c8f249d/achakraborty},
day = 18,
description = {ARTMe: a new array-based algorithm for Adaptive Refinement of Triangle Meshes | SpringerLink},
doi = {10.1007/s00366-018-0579-5},
interhash = {4c635a51bec75ae73bcfc7215907cc6d},
intrahash = {231e8143e434db227ea011444c8f249d},
issn = {1435-5663},
journal = {Engineering with Computers},
keywords = {2018 data-structure geometry mesh springer topology},
month = jan,
timestamp = {2018-06-08T16:13:10.000+0200},
title = {ARTMe: a new array-based algorithm for Adaptive Refinement of Triangle Meshes},
url = {https://doi.org/10.1007/s00366-018-0579-5},
year = 2018
}