Exact and parallel intersection of 3d triangular meshes
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Tipo de documento: | Tese |
Idioma: | eng |
Título da fonte: | LOCUS Repositório Institucional da UFV |
Texto Completo: | http://www.locus.ufv.br/handle/123456789/19990 |
Resumo: | This thesis presents an exact parallel algorithm for computing the intersection be- tween two 3D triangular meshes, as used in CAD/CAM (Computer Aided De- sign/Computer Aided Manufacturing), CFD (Computational Fluid Dynamics), GIS (Geographical Information Science) and additive manufacturing (also known as 3D Printing). Geometric software packages occasionally fail to compute the correct result because of the algorithm implementation complexity (that usually needs to handle several special cases) and of precision problems caused by floating point arithmetic. A failure in an intersection computation algorithm may propagate to any software using the algorithm as a subroutine. As datasets get bigger (and the chances of failure in an inexact algorithm increase), exact algorithms become even more important. While other methods for exactly intersecting meshes exist, their performance makes them non-suitable for applications where the fast processing of big geometric models is important (such as interactive CAD systems). The key to obtain robustness and performance is a combination of 5 separate techniques: • Multiple precision rational numbers, to exactly represent the coordinates of the objects and completely eliminate roundoff errors during the computations. • Simulation of Simplicity, a symbolic perturbation technique, to ensure that all geometric degeneracies (special cases) are properly handled. • Simple data representations and local information, to simplify the correct pro- cessing of the data and make the algorithm more parallelizable. • A uniform grid, to efficiently index the data, and accelerate some of the steps of the algorithm such as testing pairs of triangles for intersection or locating points in the mesh. |
id |
UFV_6dba4550a5ca8cc2cbaf523c65171ff2 |
---|---|
oai_identifier_str |
oai:locus.ufv.br:123456789/19990 |
network_acronym_str |
UFV |
network_name_str |
LOCUS Repositório Institucional da UFV |
repository_id_str |
2145 |
spelling |
Magalhães, Salles Viana Gomes dehttp://lattes.cnpq.br/3275856836294051Franklin, W. Randolph2018-06-06T18:52:08Z2018-06-06T18:52:08Z2017-11MAGALHÃES, Salles Viana Gomes de. Exact and parallel intersection of 3d triangular meshes. 2017. 156f. Tese (Doutorado em Computer Science) - Rensselaer Polytechnic Institute. New York. 2017.http://www.locus.ufv.br/handle/123456789/19990This thesis presents an exact parallel algorithm for computing the intersection be- tween two 3D triangular meshes, as used in CAD/CAM (Computer Aided De- sign/Computer Aided Manufacturing), CFD (Computational Fluid Dynamics), GIS (Geographical Information Science) and additive manufacturing (also known as 3D Printing). Geometric software packages occasionally fail to compute the correct result because of the algorithm implementation complexity (that usually needs to handle several special cases) and of precision problems caused by floating point arithmetic. A failure in an intersection computation algorithm may propagate to any software using the algorithm as a subroutine. As datasets get bigger (and the chances of failure in an inexact algorithm increase), exact algorithms become even more important. While other methods for exactly intersecting meshes exist, their performance makes them non-suitable for applications where the fast processing of big geometric models is important (such as interactive CAD systems). The key to obtain robustness and performance is a combination of 5 separate techniques: • Multiple precision rational numbers, to exactly represent the coordinates of the objects and completely eliminate roundoff errors during the computations. • Simulation of Simplicity, a symbolic perturbation technique, to ensure that all geometric degeneracies (special cases) are properly handled. • Simple data representations and local information, to simplify the correct pro- cessing of the data and make the algorithm more parallelizable. • A uniform grid, to efficiently index the data, and accelerate some of the steps of the algorithm such as testing pairs of triangles for intersection or locating points in the mesh.Coordenação de Aperfeiçoamento de Pessoal de Nível SuperiorengRensselaer Polytechnic InstituteComputational GeometryGeographic information scienceParallel programmingComputer aided designCiência da ComputaçãoExact and parallel intersection of 3d triangular meshesinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/doctoralThesisRensselaer Polytechnic InstituteRPI - Departament of Computer ScienceDoctor of Computer ScienceTroy, NY2017-11Doutoradoinfo:eu-repo/semantics/openAccessreponame:LOCUS Repositório Institucional da UFVinstname:Universidade Federal de Viçosa (UFV)instacron:UFVORIGINALtexto completo.pdftexto completo.pdftexto completoapplication/pdf10760567https://locus.ufv.br//bitstream/123456789/19990/1/texto%20completo.pdfe11aa8ab3d3f98f215de81a9ce967fccMD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81748https://locus.ufv.br//bitstream/123456789/19990/2/license.txt8a4605be74aa9ea9d79846c1fba20a33MD52THUMBNAILtexto completo.pdf.jpgtexto completo.pdf.jpgIM Thumbnailimage/jpeg3965https://locus.ufv.br//bitstream/123456789/19990/3/texto%20completo.pdf.jpgb8bee58ef6451e67cabae193a809d086MD53123456789/199902022-06-27 15:13:37.88oai:locus.ufv.br:123456789/19990Repositório InstitucionalPUBhttps://www.locus.ufv.br/oai/requestfabiojreis@ufv.bropendoar:21452022-06-27T18:13:37LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV)false |
dc.title.en.fl_str_mv |
Exact and parallel intersection of 3d triangular meshes |
title |
Exact and parallel intersection of 3d triangular meshes |
spellingShingle |
Exact and parallel intersection of 3d triangular meshes Magalhães, Salles Viana Gomes de Computational Geometry Geographic information science Parallel programming Computer aided design Ciência da Computação |
title_short |
Exact and parallel intersection of 3d triangular meshes |
title_full |
Exact and parallel intersection of 3d triangular meshes |
title_fullStr |
Exact and parallel intersection of 3d triangular meshes |
title_full_unstemmed |
Exact and parallel intersection of 3d triangular meshes |
title_sort |
Exact and parallel intersection of 3d triangular meshes |
author |
Magalhães, Salles Viana Gomes de |
author_facet |
Magalhães, Salles Viana Gomes de |
author_role |
author |
dc.contributor.authorLattes.pt-BR.fl_str_mv |
http://lattes.cnpq.br/3275856836294051 |
dc.contributor.author.fl_str_mv |
Magalhães, Salles Viana Gomes de |
dc.contributor.advisor1.fl_str_mv |
Franklin, W. Randolph |
contributor_str_mv |
Franklin, W. Randolph |
dc.subject.pt-BR.fl_str_mv |
Computational Geometry Geographic information science Parallel programming Computer aided design |
topic |
Computational Geometry Geographic information science Parallel programming Computer aided design Ciência da Computação |
dc.subject.cnpq.fl_str_mv |
Ciência da Computação |
description |
This thesis presents an exact parallel algorithm for computing the intersection be- tween two 3D triangular meshes, as used in CAD/CAM (Computer Aided De- sign/Computer Aided Manufacturing), CFD (Computational Fluid Dynamics), GIS (Geographical Information Science) and additive manufacturing (also known as 3D Printing). Geometric software packages occasionally fail to compute the correct result because of the algorithm implementation complexity (that usually needs to handle several special cases) and of precision problems caused by floating point arithmetic. A failure in an intersection computation algorithm may propagate to any software using the algorithm as a subroutine. As datasets get bigger (and the chances of failure in an inexact algorithm increase), exact algorithms become even more important. While other methods for exactly intersecting meshes exist, their performance makes them non-suitable for applications where the fast processing of big geometric models is important (such as interactive CAD systems). The key to obtain robustness and performance is a combination of 5 separate techniques: • Multiple precision rational numbers, to exactly represent the coordinates of the objects and completely eliminate roundoff errors during the computations. • Simulation of Simplicity, a symbolic perturbation technique, to ensure that all geometric degeneracies (special cases) are properly handled. • Simple data representations and local information, to simplify the correct pro- cessing of the data and make the algorithm more parallelizable. • A uniform grid, to efficiently index the data, and accelerate some of the steps of the algorithm such as testing pairs of triangles for intersection or locating points in the mesh. |
publishDate |
2017 |
dc.date.issued.fl_str_mv |
2017-11 |
dc.date.accessioned.fl_str_mv |
2018-06-06T18:52:08Z |
dc.date.available.fl_str_mv |
2018-06-06T18:52:08Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/doctoralThesis |
format |
doctoralThesis |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
MAGALHÃES, Salles Viana Gomes de. Exact and parallel intersection of 3d triangular meshes. 2017. 156f. Tese (Doutorado em Computer Science) - Rensselaer Polytechnic Institute. New York. 2017. |
dc.identifier.uri.fl_str_mv |
http://www.locus.ufv.br/handle/123456789/19990 |
identifier_str_mv |
MAGALHÃES, Salles Viana Gomes de. Exact and parallel intersection of 3d triangular meshes. 2017. 156f. Tese (Doutorado em Computer Science) - Rensselaer Polytechnic Institute. New York. 2017. |
url |
http://www.locus.ufv.br/handle/123456789/19990 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.publisher.none.fl_str_mv |
Rensselaer Polytechnic Institute |
publisher.none.fl_str_mv |
Rensselaer Polytechnic Institute |
dc.source.none.fl_str_mv |
reponame:LOCUS Repositório Institucional da UFV instname:Universidade Federal de Viçosa (UFV) instacron:UFV |
instname_str |
Universidade Federal de Viçosa (UFV) |
instacron_str |
UFV |
institution |
UFV |
reponame_str |
LOCUS Repositório Institucional da UFV |
collection |
LOCUS Repositório Institucional da UFV |
bitstream.url.fl_str_mv |
https://locus.ufv.br//bitstream/123456789/19990/1/texto%20completo.pdf https://locus.ufv.br//bitstream/123456789/19990/2/license.txt https://locus.ufv.br//bitstream/123456789/19990/3/texto%20completo.pdf.jpg |
bitstream.checksum.fl_str_mv |
e11aa8ab3d3f98f215de81a9ce967fcc 8a4605be74aa9ea9d79846c1fba20a33 b8bee58ef6451e67cabae193a809d086 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV) |
repository.mail.fl_str_mv |
fabiojreis@ufv.br |
_version_ |
1801213136634642432 |