Please use this identifier to cite or link to this item:
http://hdl.handle.net/10553/45250
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Montenegro, Rafael | |
dc.contributor.author | Escobar, José María | |
dc.contributor.author | Rodríguez, Eduardo | |
dc.contributor.author | Montero, G | |
dc.contributor.author | González-Yuste, José María | |
dc.contributor.other | Montenegro Armas, Rafael | |
dc.contributor.other | Montero, Gustavo | |
dc.contributor.other | Escobar, Jose M. | |
dc.contributor.other | Rodriguez, Eduardo | |
dc.date.accessioned | 2018-11-22T08:22:56Z | - |
dc.date.available | 2018-11-22T08:22:56Z | - |
dc.date.issued | 2003 | |
dc.identifier.isbn | 3-540-40194-6 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | http://hdl.handle.net/10553/45250 | - |
dc.description.abstract | The quality improvement in mesh optimisation techniques that preserve its connectivity are obtained by an iterative process in which each node of the mesh is moved to a new position that minimises a certain objective function. In general, objective functions are derived from some quality measure of the local submesh, that is, the set of tetrahedra connected to the adjustable or free node. Although these objective functions are suitable to improve the quality of a mesh in which there are non inverted elements, they are not when the mesh is tangled. This is due to the fact that usual objective functions are not defined on all R-3 and they present several discontinuities and local minima that prevent the use of conventional optimisation procedures. Otherwise, when the mesh is tangled, there are local submeshes for which the free node is out of the feasible region, or this does not exist. In this paper we propose the substitution of objective functions having barriers by modified versions that are defined and regular on all R-3. With these modifications, the optimisation process is also directly applicable to meshes with inverted elements, making a previous untangling procedure unnecessary. | |
dc.publisher | 0302-9743 | |
dc.relation.ispartof | Lecture Notes in Computer Science | |
dc.source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)[ISSN 0302-9743],v. 2657, p. 568-578 | |
dc.subject.other | Condition Number | |
dc.subject.other | Quality | |
dc.title | Improved objective functions for tetrahedral mesh optimisation | |
dc.type | info:eu-repo/semantics/Article | es |
dc.type | Article | es |
dc.relation.conference | International Conference on Computational Science (ICCS 2003) | |
dc.identifier.scopus | 35248825465 | |
dc.identifier.isi | 000184831700059 | |
dcterms.isPartOf | Computational Science - Iccs 2003, Pt I, Proceedings | |
dcterms.source | Computational Science - Iccs 2003, Pt I, Proceedings[ISSN 0302-9743],v. 2657, p. 568-578 | |
dc.contributor.authorscopusid | 35617533100 | |
dc.contributor.authorscopusid | 7101961409 | |
dc.contributor.authorscopusid | 7401953314 | |
dc.contributor.authorscopusid | 22734611100 | |
dc.contributor.authorscopusid | 6507300174 | |
dc.description.lastpage | 578 | |
dc.description.firstpage | 568 | |
dc.relation.volume | 2657 | |
dc.type2 | Artículo | es |
dc.identifier.wos | WOS:000184831700059 | |
dc.contributor.daisngid | 656681 | |
dc.contributor.daisngid | 622620 | |
dc.contributor.daisngid | 1187392 | |
dc.contributor.daisngid | 689363 | |
dc.contributor.daisngid | 3496788 | |
dc.identifier.investigatorRID | L-1365-2014 | |
dc.identifier.investigatorRID | L-1011-2014 | |
dc.identifier.investigatorRID | K-7710-2014 | |
dc.identifier.investigatorRID | K-9395-2014 | |
dc.contributor.wosstandard | WOS:Montenegro, R | |
dc.contributor.wosstandard | WOS:Escobar, JM | |
dc.contributor.wosstandard | WOS:Rodriguez, E | |
dc.contributor.wosstandard | WOS:Montero, G | |
dc.contributor.wosstandard | WOS:Gonzalez-Yuste, JM | |
dc.date.coverdate | Diciembre 2003 | |
dc.identifier.conferenceid | events120360 | |
dc.identifier.ulpgc | Sí | es |
item.grantfulltext | none | - |
item.fulltext | Sin texto completo | - |
crisitem.event.eventsstartdate | 02-06-2003 | - |
crisitem.event.eventsenddate | 04-06-2003 | - |
crisitem.author.dept | GIR SIANI: Modelización y Simulación Computacional | - |
crisitem.author.dept | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.dept | Departamento de Matemáticas | - |
crisitem.author.dept | GIR SIANI: Modelización y Simulación Computacional | - |
crisitem.author.dept | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.dept | Departamento de Señales y Comunicaciones | - |
crisitem.author.dept | GIR SIANI: Modelización y Simulación Computacional | - |
crisitem.author.dept | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.dept | Departamento de Informática y Sistemas | - |
crisitem.author.dept | GIR SIANI: Modelización y Simulación Computacional | - |
crisitem.author.dept | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.dept | Departamento de Matemáticas | - |
crisitem.author.orcid | 0000-0002-4164-457X | - |
crisitem.author.orcid | 0000-0002-8608-7076 | - |
crisitem.author.orcid | 0000-0002-2701-2971 | - |
crisitem.author.orcid | 0000-0001-5641-442X | - |
crisitem.author.parentorg | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.parentorg | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.parentorg | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.parentorg | IU Sistemas Inteligentes y Aplicaciones Numéricas | - |
crisitem.author.fullName | Montenegro Armas, Rafael | - |
crisitem.author.fullName | Escobar Sánchez, José M | - |
crisitem.author.fullName | Rodríguez Barrera, Eduardo Miguel | - |
crisitem.author.fullName | Montero García, Gustavo | - |
Appears in Collections: | Artículos |
SCOPUSTM
Citations
2
checked on Nov 17, 2024
WEB OF SCIENCETM
Citations
3
checked on Feb 25, 2024
Page view(s)
50
checked on Feb 24, 2024
Google ScholarTM
Check
Altmetric
Share
Export metadata
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.