Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitives

In this work we report on two algorithms that mesh a 2D CSG poligonal domain built from previously meshed primitives. The resulting mesh is computed from the component meshes. Both algorithms first compute the set of cells of each mesh that overlap. One algorithm uses a propagation technique. Every...

Descripción completa

Detalles Bibliográficos
Autores: Joan Arinyo, Robert|||0000-0002-1896-2940, Solé Simó, Marc|||0000-0001-7056-4600
Tipo de recurso: informe técnico
Fecha de publicación:1999
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/93018
Acceso en línea:https://hdl.handle.net/2117/93018
Access Level:acceso abierto
Palabra clave:2D CSG
Mesh
Polygonal domain
Àrees temàtiques de la UPC::Informàtica::Infografia
id ES_aabeed3d9b2e387316d01a7972e42e2e
oai_identifier_str oai:upcommons.upc.edu:2117/93018
network_acronym_str ES
network_name_str España
repository_id_str
spelling Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitivesJoan Arinyo, Robert|||0000-0002-1896-2940Solé Simó, Marc|||0000-0001-7056-46002D CSGMeshPolygonal domainÀrees temàtiques de la UPC::Informàtica::InfografiaIn this work we report on two algorithms that mesh a 2D CSG poligonal domain built from previously meshed primitives. The resulting mesh is computed from the component meshes. Both algorithms first compute the set of cells of each mesh that overlap. One algorithm uses a propagation technique. Every two nodes in the overlapping area that are closer enough are collapsed into a new node. The final state is reached when nodes no longer collapse. The other algorithm is based on a relaxation technique. An energy function is associated with each node in the areas where the meshes overlap. The minimization of the total energy function leads the nodes to an steady state that defines the final mesh. We give some examples that illustrate how the algorithms work.19991999-04-0120162016-11-07reporthttp://purl.org/coar/resource_type/c_93fcAOhttp://purl.org/coar/version/c_b1a7d7d4d402bcceinfo:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/93018reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/930182026-05-27T15:37:01Z
dc.title.none.fl_str_mv Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitives
title Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitives
spellingShingle Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitives
Joan Arinyo, Robert|||0000-0002-1896-2940
2D CSG
Mesh
Polygonal domain
Àrees temàtiques de la UPC::Informàtica::Infografia
title_short Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitives
title_full Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitives
title_fullStr Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitives
title_full_unstemmed Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitives
title_sort Algorithms to mesh 2D CSG polygonal domains from previously meshed CSG primitives
dc.creator.none.fl_str_mv Joan Arinyo, Robert|||0000-0002-1896-2940
Solé Simó, Marc|||0000-0001-7056-4600
author Joan Arinyo, Robert|||0000-0002-1896-2940
author_facet Joan Arinyo, Robert|||0000-0002-1896-2940
Solé Simó, Marc|||0000-0001-7056-4600
author_role author
author2 Solé Simó, Marc|||0000-0001-7056-4600
author2_role author
dc.subject.none.fl_str_mv 2D CSG
Mesh
Polygonal domain
Àrees temàtiques de la UPC::Informàtica::Infografia
topic 2D CSG
Mesh
Polygonal domain
Àrees temàtiques de la UPC::Informàtica::Infografia
description In this work we report on two algorithms that mesh a 2D CSG poligonal domain built from previously meshed primitives. The resulting mesh is computed from the component meshes. Both algorithms first compute the set of cells of each mesh that overlap. One algorithm uses a propagation technique. Every two nodes in the overlapping area that are closer enough are collapsed into a new node. The final state is reached when nodes no longer collapse. The other algorithm is based on a relaxation technique. An energy function is associated with each node in the areas where the meshes overlap. The minimization of the total energy function leads the nodes to an steady state that defines the final mesh. We give some examples that illustrate how the algorithms work.
publishDate 1999
dc.date.none.fl_str_mv 1999
1999-04-01
2016
2016-11-07
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
AO
http://purl.org/coar/version/c_b1a7d7d4d402bcce
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/93018
url https://hdl.handle.net/2117/93018
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869416208518873088
score 15,300719

Similares en LA Referencia