Boolean operations on surfel-bounded objects using constrained BSP-trees

Marcus A.C. Farias, Carlos E. Scheidegger, João L.D. Comba, Luiz C. Velho

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

Point-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 BSP-tree (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 axis-aligned structures.

Original languageEnglish (US)
Title of host publicationSIBGRAPI 2005
Subtitle of host publication18th Brazilian Symposium on Computer Graphics and Image Processing - Conference Proceedings
Pages325-332
Number of pages8
DOIs
StatePublished - Dec 1 2005
Externally publishedYes
EventSIBGRAPI 2005: 18th Brazilian Symposium on Computer Graphics and Image Processing - Conference Proceedings - Natal, Rio Grande do Norte, Brazil
Duration: Oct 9 2005Oct 12 2005

Publication series

NameBrazilian Symposium of Computer Graphic and Image Processing
Volume2005
ISSN (Print)1530-1834

Other

OtherSIBGRAPI 2005: 18th Brazilian Symposium on Computer Graphics and Image Processing - Conference Proceedings
CountryBrazil
CityNatal, Rio Grande do Norte
Period10/9/0510/12/05

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Boolean operations on surfel-bounded objects using constrained BSP-trees'. Together they form a unique fingerprint.

  • Cite this

    Farias, M. A. C., Scheidegger, C. E., Comba, J. L. D., & Velho, L. C. (2005). Boolean operations on surfel-bounded objects using constrained BSP-trees. In SIBGRAPI 2005: 18th Brazilian Symposium on Computer Graphics and Image Processing - Conference Proceedings (pp. 325-332). [1599120] (Brazilian Symposium of Computer Graphic and Image Processing; Vol. 2005). https://doi.org/10.1109/SIBGRAPI.2005.17