By Topic

Binary space partitioning trees: a multiresolution approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
J. Huerta ; Dept. of Comput. Sci., Jaume I Univ., Castellon, Spain ; M. Chover ; R. Quiros ; R. Vivo
more authors

Space partitioning techniques are a useful means of organizing geometric models into data structures. Such data structures provide easy and efficient access to a wide range of computer graphics and visualization applications like real time rendering of large databases, collision detection, point classification, etc. Binary space partitioning (BSP) trees are one of the most successful space partitioning techniques, since they allow both object modeling and classification in one single structure. However, with the advent of networked graphics applications, there is an increasing need for multiresolution geometric representations. The paper presents a novel method that extends BSP trees to provide such a representation. The models we present have the advantages of both BSP trees and multiresolution representations. Nodes near the root of the BSP tree store coarser versions of the geometry, while leaf nodes provide the finest details of the representation. We present different algorithms to construct multiresolution BSP trees in 2D. Then we propose extensions of our methods to 3D space

Published in:

Information Visualization, 1997. Proceedings., 1997 IEEE Conference on

Date of Conference:

27-29 Aug 1997