Region representation: boundary codes from quadtrees
Communications of the ACM
A consistent hierarchical representation for vector data
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Set operations on polyhedra using binary space partitioning trees
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Hierarchical Data Structures and Algorithms for Computer Graphics. Part I.
IEEE Computer Graphics and Applications
Solid representation and operation using extended octrees
ACM Transactions on Graphics (TOG)
Three-dimensional medical imaging: algorithms and computer systems
ACM Computing Surveys (CSUR)
An improved z-buffer CSG rendering algorithm
HWWS '98 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
V-Clip: fast and robust polyhedral collision detection
ACM Transactions on Graphics (TOG)
Topology-reducing surface simplification using a discrete solid representation
ACM Transactions on Graphics (TOG)
Journal of Intelligent and Robotic Systems
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Spatial data base queries: relational algebra versus computational geometry
SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management
B-rep SE: simplicially enhanced boundary representation
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
A sorting approach to indexing spatial data
ACM SIGGRAPH 2008 classes
Computer Graphics in Spain: Bounding-planes Octree: A new volume-based LOD scheme
Computers and Graphics
Collision detection between complex polyhedra
Computers and Graphics
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
ACM SIGGRAPH ASIA 2010 Courses
Industrial application of exact Boolean operations for meshes
Proceedings of the 26th Spring Conference on Computer Graphics
Tetra-trees properties in graphic interaction
Graphical Models
Fast and accurate evaluation of regularized Boolean operations on triangulated solids
Computer-Aided Design
| Hi-index | 0.01 |
Quadtree representation of two-dimensional objects is performed with a tree that describes the recursive subdivision of the more complex parts of a picture until the desired resolution is reached. At the end, all the leaves of the tree are square cells that lie completely inside or outside the object. There are two great disadvantages in the use of quadtrees as a representation scheme for objects in geometric modeling system: The amount of memory required for polygonal objects is too great, and it is difficult to recompute the boundary representation of the object after some Boolean operations have been performed. In the present paper a new class of quadtrees, in which nodes may contain zero or one edge, is introduced. By using these quadtrees, storage requirements are reduced and it is possible to obtain the exact backward conversion to boundary representation. Algorithms for the generation of the quadtree, Boolean operations, and recomputation of the boundary representation are presented, and their complexities in time and space are discussed. Three-dimensional algorithms working on octrees are also presented. Their use in the geometric modeling of three-dimensional polyhedral objects is discussed.