Close
Metadata

Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Identifier6qtX3pFwXQZeBBx/GKsqL
Repositorysid.inpe.br/banon/2005/07.13.20.58
Last Update2005:07.14.03.00.00 (UTC) administrator
Metadatasid.inpe.br/banon/2005/07.13.20.58.22
Metadata Last Update2020:02.19.03.19.14 (UTC) administrator
Citation KeyFariasScheCombVelh:2005:BoOpSu
TitleBoolean operations on surfel-bounded objects using constrained BSP-trees
FormatOn-line
Year2005
Access Date2021, Nov. 27
Number of Files1
Size531 KiB
Context area
Author1 Farias, Marcus A. C.
2 Scheidegger, Carlos E.
3 Comba, João L. D.
4 Velho, Luiz C.
Affiliation1 Instituto de Informática, UFRGS
2 Scientific Computing and Imaging Institute, University of Utah
3 Instituto de Matem´atica Pura e Aplicada
EditorRodrigues, Maria Andréia Formico
Frery, Alejandro César
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 18 (SIBGRAPI)
Conference LocationNatal
Date9-12 Oct. 2005
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2008-08-26 15:17:02 :: banon -> administrator ::
2009-08-13 20:37:50 :: administrator -> banon ::
2010-08-28 20:01:18 :: banon -> administrator ::
2020-02-19 03:19:14 :: administrator -> :: 2005
Content and structure area
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
KeywordsBSP-trees
Boolean operations
operações Booleanas
surfel
AbstractPoint-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and many algorithms have been devised to their efficient manipulation and rendering. Key to the efficiency of many methods is the use of partitioning schemes, and usually axis-aligned structures such as octrees and KD-trees are preferred, instead of more general BSP-trees. In this work we introduce a data structure called Constrained BSPtree (CBSP-tree) that can be seen as an intermediate structure between KD-trees and BSP-trees. The CBSP-tree is characterized by allowing arbitrary cuts as long as the complexity of its cells remains bounded, allowing better approximation of curved regions. We discuss algorithms to build CBSP-trees using the flexibility that the structure offers, and present a modified algorithm for boolean operations that uses a new inside-outside object classification. Results show that CBSP-trees generate fewer cells than axisaligned structures.
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
Conditions of access and use area
data URLhttp://urlib.net/ibi/6qtX3pFwXQZeBBx/GKsqL
zipped data URLhttp://urlib.net/zip/6qtX3pFwXQZeBBx/GKsqL
Languageen
Target Filefariasm_constrained_bsp.pdf
User Groupbanon
administrator
Visibilityshown
Allied materials area
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
Notes area
Empty Fieldsaccessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi e-mailaddress edition electronicmailaddress group holdercode isbn issn label lineage mark mirrorrepository nextedition nexthigherunit notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume

Close