Orthogonal polyhedra as geometric bounds in constructive solid geometry

Set membership classification and, specifically, the evaluation of a CSG tree are problems of a certain complexity. Several techniques to speed up these processes have been proposed such as Active Zones, Geometric Bounds and the Extended Convex Differences Tree. Boxes are the most common geometric b...

Descripción completa

Detalles Bibliográficos
Autores: Aguilera, A, Ayala Vallespí, M. Dolors|||0000-0003-4931-0467
Tipo de recurso: informe técnico
Fecha de publicación:1996
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/97221
Acceso en línea:https://hdl.handle.net/2117/97221
Access Level:acceso abierto
Palabra clave:Membership classification
CSG evaluation
Ortogonal polyhedra
CSG model
Linear complexity
Àrees temàtiques de la UPC::Informàtica::Infografia
id ES_49465d0eec6e8908a9de302fa99cea9d
oai_identifier_str oai:upcommons.upc.edu:2117/97221
network_acronym_str ES
network_name_str España
repository_id_str
spelling Orthogonal polyhedra as geometric bounds in constructive solid geometryAguilera, AAyala Vallespí, M. Dolors|||0000-0003-4931-0467Membership classificationCSG evaluationOrtogonal polyhedraCSG modelLinear complexityÀrees temàtiques de la UPC::Informàtica::InfografiaSet membership classification and, specifically, the evaluation of a CSG tree are problems of a certain complexity. Several techniques to speed up these processes have been proposed such as Active Zones, Geometric Bounds and the Extended Convex Differences Tree. Boxes are the most common geometric bounds studied but other bounds such as spheres, convex hulls and prisms have also been proposed. In this work we propose orthogonal polyhedra as geometric bounds in the CSG model. CSG primitives are approximated by orthogonal polyhedra and the orthogonal bound of the object is obtained by applying the corresponding boolean algebra. A specific model for orthogonal polyhedra is presented that allows a simple and robust boolean operations algorithm between orthogonal polyhedra. This algorithm has linear complexity (is based on a merging process) and avoids floating-point computation.19961996-12-0120162016-11-25reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/97221reponame: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/972212026-05-27T15:37:01Z
dc.title.none.fl_str_mv Orthogonal polyhedra as geometric bounds in constructive solid geometry
title Orthogonal polyhedra as geometric bounds in constructive solid geometry
spellingShingle Orthogonal polyhedra as geometric bounds in constructive solid geometry
Aguilera, A
Membership classification
CSG evaluation
Ortogonal polyhedra
CSG model
Linear complexity
Àrees temàtiques de la UPC::Informàtica::Infografia
title_short Orthogonal polyhedra as geometric bounds in constructive solid geometry
title_full Orthogonal polyhedra as geometric bounds in constructive solid geometry
title_fullStr Orthogonal polyhedra as geometric bounds in constructive solid geometry
title_full_unstemmed Orthogonal polyhedra as geometric bounds in constructive solid geometry
title_sort Orthogonal polyhedra as geometric bounds in constructive solid geometry
dc.creator.none.fl_str_mv Aguilera, A
Ayala Vallespí, M. Dolors|||0000-0003-4931-0467
author Aguilera, A
author_facet Aguilera, A
Ayala Vallespí, M. Dolors|||0000-0003-4931-0467
author_role author
author2 Ayala Vallespí, M. Dolors|||0000-0003-4931-0467
author2_role author
dc.subject.none.fl_str_mv Membership classification
CSG evaluation
Ortogonal polyhedra
CSG model
Linear complexity
Àrees temàtiques de la UPC::Informàtica::Infografia
topic Membership classification
CSG evaluation
Ortogonal polyhedra
CSG model
Linear complexity
Àrees temàtiques de la UPC::Informàtica::Infografia
description Set membership classification and, specifically, the evaluation of a CSG tree are problems of a certain complexity. Several techniques to speed up these processes have been proposed such as Active Zones, Geometric Bounds and the Extended Convex Differences Tree. Boxes are the most common geometric bounds studied but other bounds such as spheres, convex hulls and prisms have also been proposed. In this work we propose orthogonal polyhedra as geometric bounds in the CSG model. CSG primitives are approximated by orthogonal polyhedra and the orthogonal bound of the object is obtained by applying the corresponding boolean algebra. A specific model for orthogonal polyhedra is presented that allows a simple and robust boolean operations algorithm between orthogonal polyhedra. This algorithm has linear complexity (is based on a merging process) and avoids floating-point computation.
publishDate 1996
dc.date.none.fl_str_mv 1996
1996-12-01
2016
2016-11-25
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/97221
url https://hdl.handle.net/2117/97221
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_ 1869407412016906240
score 15,300719

Similares en LA Referencia