Tiankai Tu and David R. O'Hallaron April, 2004 CMU-CS-04-129 School of...  Home/Search
Context
Related
| cmu.edu/user/droh/w...CMUCS04129.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: cmu.edu/user/droh/www/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many applications that use octrees require that the octree decomposition be smooth throughout the domain with no sharp change in size between spatially adjacent octants, thus impose a so-called 2-to-1 constraint on the octree datasets. The process of enforcing the 2-to-1 constraint on an existing octree dataset is called balance refinement. Although it is relatively easy to conduct balance refinement on memory-resident octree datasets, it represents a major challenge when massive linear octree... (Update)
Active bibliography (related documents): More All
0.4: Extracting Hexahedral Mesh Structures From - Balanced Linear Octrees (Correct)
0.4: A Computational Database System for Generating Unstructured - Hexahedral Meshes With (Correct)
0.3: The Etree Library: - System For Manipulating (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ and-balance,
author = "Tiankai Tu And",
title = "Balance Refinement of Massive Linear Octree Datasets",
url = "citeseer.ist.psu.edu/753032.html" }
Citations (may not include all citations):229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1990
198 Organization and maintenance of large ordered indices (context) - Bayer, McCreight - 1972
109 Provably good mesh generation - Bern, Eppstein et al. - 1990
79 Refinement algorithms and data structures for regular local .. (context) - Bank, Sherman et al. - 1983
64 Quality mesh generation in three dimensions - Mitchell, Vavasis - 1992
59 External memory algorithms and data structures: Dealing with.. - Vitter - 2001
58 Searching Multimedia Databases by Content (context) - Faloutsos - 1996
29 A data structure and algorithm based on a linear key for a r.. (context) - Abel, Smith - 1983
24 A locally refined rectangular grid finite element: Applicati.. (context) - Young, Melvin et al. - 1991
24 Large-scale simulation of elastic wave propagation in hetero.. (context) - Bao, Bielak et al. - 1998
21 Parallel multigrid in an adaptive pde solver based on hashin.. - Griebel, Zumbusch - 1999
14 Etree: A database-oriented method for generating large octre.. - Tu, O'Hallaron et al. - 2002
13 High resolution forward and inverse earthquake modeling on t.. - Akcelik, Bielak et al.
6 The etree library: A system for manipulating large octrees o.. (context) - Tu, O'Hallaron et al. - 2003
6 Automatic three-dimensional mesh generation by the modified-.. (context) - Yerry, Shepard - 1965
5 Linear octree for fast processing of three-dimensional objec.. (context) - Garnagntini - 1982
3 Cost prediction for ray shooting - Aronov, Bonnimann - 2002
1 The cost of balancing generalized quadtrees - Moore - 1995
Documents on the same site (http://www.cs.cmu.edu/afs/cs.cmu.edu/user/droh/www/papers.html): More
A Computational Database System for Generating Unstructured - Hexahedral Meshes With (Correct)
Big Wins with Small Application-aware Caches - Julio Opez Jclopez (Correct)
Unknown - Technology Journal Toward (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC