## Partitioning and Ordering Large Radiosity Computations (1994)

### Cached

### Download Links

- [www.cs.princeton.edu]
- [graphics.lcs.mit.edu]
- [people.csail.mit.edu]
- [people.csail.mit.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 49 - 5 self |

### BibTeX

@MISC{Teller94partitioningand,

author = {Seth Teller and Celeste Fowler and Thomas Funkhouser and Pat Hanrahan},

title = {Partitioning and Ordering Large Radiosity Computations},

year = {1994}

}

### Years of Citing Articles

### OpenURL

### Abstract

We describe a system that computes radiosity solutions for polygonal environments much larger than can be stored in main memory. The solution is stored in and retrieved from a database as the computation proceeds. Our system is based on two ideas: the use of visibility oracles to find source and blocker surfaces potentially visible to a receiving surface; and the use of hierarchical techniques to represent interactions between large surfaces efficiently, and to represent the computed radiosity solution compactly. Visibility information allows the environment to be partitioned into subsets, each containing all the information necessary to transfer light to a cluster of receiving polygons. Since the largest subset needed for any particular cluster is much smaller than the total size of the environment, these subset computations can be performed in much less memory than can classical or hierarchical radiosity. The computation is then ordered for further efficiency. Careful ordering of ene...

### Citations

397 | Adaptive Display Algorithm for Interactive Frame Rates During Visualization of Complex Virtual Environments
- Funkhouser, Séquin
- 1993
(Show Context)
Citation Context ... maintain an interactive frame rate in the walkthrough. The hierarchical (quadtree) representation of radiosity on each polygon is particularly useful, as it allows easily selectable levels of detail =-=[10]-=- for each polygon.sPlate I. The entire furnished floor, solved to one inch effective resolution (734,665 elements). Plate II: Office, gouraud shaded. Plate IV: Workroom, gouraud shaded. Plate III: Off... |

369 | A rapid hierarchical radiosity algorithm
- Hanrahan, Salzman, et al.
- 1991
(Show Context)
Citation Context ...diosity algorithm applied techniques developed for the n-body problem, incorporating a global error bound and allowing surfaces to exchange energy whenever they could do so within the specified error =-=[15]-=-. Thus, wherever sufficiently far-apart or dim surfaces interact, hierarchical methods essentially compact a block of the form-factor matrix into a scalar. Recursive application of this idea yielded a... |

281 | Visibility preprocessing for interactive walkthroughs
- Teller, Séquin
- 1991
(Show Context)
Citation Context ...urning them to the database. • The database contains a persistent (disk) representation of all clusters and a hierarchical spatial subdivision comprised of convex cells and portals that connect cells =-=[26]-=-. The database supports the operations of reading, dirtying, and releasing clusters [9, 11]. Releases of dirty data result in deferred writes to persistent storage. • The global visibility oracle, giv... |

271 |
The hemi-cube: A radiosity solution for complex environments
- Cohen, Greenberg
- 1985
(Show Context)
Citation Context ...f the model. Classical radiosity algorithms used a “hemicube” algorithm to approximate each surface’s occluded view of the model as an environment map onto faces of a cube centered on a surface point =-=[6]-=-. The projection operation involved the whole model and respected depth, producing discretized surface fragments visible to the sample point. This and other point-sampling techniques (e.g., [4]) may n... |

237 | A progressive refinement approach to fast radiosity image generation
- Cohen, Chen, et al.
- 1988
(Show Context)
Citation Context ...torage is unlimited, the optimal intermediate complexity is that associated with the most rapidly converging iterative scheme. Model Surfaces Patches Elements Time Theater [1] ∼5K ∼80K ∼1M 192 H Mill =-=[5]-=- ∼30K ∼50K 195 H Cathedral [28] ∼10K ∼75K 1 H Table 1: Previous complex radiosity solutions. Several complex radiosity computations have been reported in the literature (Table 1). Perhaps the most com... |

148 | Wavelet radiosity
- GORTLER, SCHRÖDER, et al.
- 1993
(Show Context)
Citation Context ...functions defined over each surface [16, 17, 27, 30]. The resulting solutions have better smoothness and convergence behavior than those of classical radiosity. Recently, the wavelet radiosity method =-=[13, 21]-=- combined hierarchical radiosity with Galerkin techniques. 3 Basic Ideas Our system is based on two ideas: partitioning and ordering. Partitioning decomposes the database into subsets. Each subset con... |

131 | A clustering algorithm for radiosity in complex environments
- Smits, Arvo, et al.
- 1994
(Show Context)
Citation Context ... radiosity algorithm did not address the “clustering” problem of efficiently handling interactions among surfaces composed of many small surfaces; some techniques have been recently proposed to do so =-=[20, 22, 29]-=-. • Meshing and Finite Element Methods. Finally, meshing and finite-element techniques have been employed to improve the accuracy of radiosity solutions. Classical and hierarchical solution algorithms... |

111 | Management of large amounts of data in interactive building walkthroughs
- FUNKHOUSER, SÉQUIN, et al.
- 1992
(Show Context)
Citation Context ...of all clusters and a hierarchical spatial subdivision comprised of convex cells and portals that connect cells [26]. The database supports the operations of reading, dirtying, and releasing clusters =-=[9, 11]-=-. Releases of dirty data result in deferred writes to persistent storage. • The global visibility oracle, given a receiver cluster, identifies those clusters potentially visible to the receiver, i.e.,... |

110 |
Visibility Computations in Densely Occluded Polyhedral Environments
- Teller
- 1992
(Show Context)
Citation Context ...obal visibility oracle, given a receiver cluster, identifies those clusters potentially visible to the receiver, i.e., those clusters that may illuminate the receiver, or block energy transfers to it =-=[23, 25]-=-. A cluster may be visible to itself. • The hierarchical wavelet radiosity solver generates highquality radiosity solutions using wavelet bases of general order and Gaussian quadrature [13, 15, 21]. •... |

107 |
A Ray Tracing Algorithm for Progressive Radiosity
- Wallace, Elmquist, et al.
- 1989
(Show Context)
Citation Context ...al intermediate complexity is that associated with the most rapidly converging iterative scheme. Model Surfaces Patches Elements Time Theater [1] ∼5K ∼80K ∼1M 192 H Mill [5] ∼30K ∼50K 195 H Cathedral =-=[28]-=- ∼10K ∼75K 1 H Table 1: Previous complex radiosity solutions. Several complex radiosity computations have been reported in the literature (Table 1). Perhaps the most complex is the Candlestick Theater... |

106 | Combining hierarchical radiosity and discontinuity meshing
- Lischinski, Tampieri, et al.
- 1993
(Show Context)
Citation Context ...onstant over each surface. Galerkin-based methods use finite element techniques to represent radiosities more generally, as weighted sums of smoothly varying basis functions defined over each surface =-=[16, 17, 27, 30]-=-. The resulting solutions have better smoothness and convergence behavior than those of classical radiosity. Recently, the wavelet radiosity method [13, 21] combined hierarchical radiosity with Galerk... |

91 | M.: Global Visibility Algorithm for Illumination Computations. siggraph
- Teller, Hanrahan
- 1993
(Show Context)
Citation Context ...y, preprocessing and incremental maintenance techniques used a coherent global pass through the model to generate initial blocker lists, then maintained the lists incrementally under link subdivision =-=[25]-=-. These techniques, in contrast to those based on point-sampling, are conservative in the sense that they never wrongly exclude a blocker or light source from an interaction. • Solution Methods. Class... |

72 |
Galerkin radiosity: A higher order solution method for global illumination
- Zatz
- 1993
(Show Context)
Citation Context ...onstant over each surface. Galerkin-based methods use finite element techniques to represent radiosities more generally, as weighted sums of smoothly varying basis functions defined over each surface =-=[16, 17, 27, 30]-=-. The resulting solutions have better smoothness and convergence behavior than those of classical radiosity. Recently, the wavelet radiosity method [13, 21] combined hierarchical radiosity with Galerk... |

63 |
Shaft Culling for Efficient Ray-Traced Radiosity
- Haines, Wallace
- 1994
(Show Context)
Citation Context ...al visibility into a collection of visibility subspaces by generating a common shaft volume for each interacting pair, and treating as blockers only those objects (potentially) intersecting the shaft =-=[14, 18]-=-. Finally, preprocessing and incremental maintenance techniques used a coherent global pass through the model to generate initial blocker lists, then maintained the lists incrementally under link subd... |

55 |
Making Radiosity Usable: Automatic Preprocessing and Meshing Techniques for the Generation of Accurate Radiosity Solutions
- Baum, Mann, et al.
- 1991
(Show Context)
Citation Context ...adiosity simulations. When storage is unlimited, the optimal intermediate complexity is that associated with the most rapidly converging iterative scheme. Model Surfaces Patches Elements Time Theater =-=[1]-=- ∼5K ∼80K ∼1M 192 H Mill [5] ∼30K ∼50K 195 H Cathedral [28] ∼10K ∼75K 1 H Table 1: Previous complex radiosity solutions. Several complex radiosity computations have been reported in the literature (Ta... |

48 |
Adaptive mesh generation for global diffuse illumination
- Campbell, Fussell
- 1990
(Show Context)
Citation Context ... point [6]. The projection operation involved the whole model and respected depth, producing discretized surface fragments visible to the sample point. This and other point-sampling techniques (e.g., =-=[4]-=-) may not detect relevant light sources and/or blockers, however. Shaft culling recast global visibility into a collection of visibility subspaces by generating a common shaft volume for each interact... |

41 | Wavelet projections for radiosity
- Schröder, Gortler, et al.
- 1993
(Show Context)
Citation Context ...functions defined over each surface [16, 17, 27, 30]. The resulting solutions have better smoothness and convergence behavior than those of classical radiosity. Recently, the wavelet radiosity method =-=[13, 21]-=- combined hierarchical radiosity with Galerkin techniques. 3 Basic Ideas Our system is based on two ideas: partitioning and ordering. Partitioning decomposes the database into subsets. Each subset con... |

38 |
Acceleration techniques for progressive refinement radiosity
- Recker, George, et al.
- 1990
(Show Context)
Citation Context ... bookkeeping, since each shoot updates many brightnesses, and the relative priorities of queued shooters may change considerably. Parallel implementations of progressive refinement have been reported =-=[2, 19]-=-. “Super-shoot gather” techniques repeatedly (over)shoot from and gather to a small number of surfaces, ignoring any interactions not involving the shooters [7, 12]. • Hierarchical Approaches and Clus... |

36 |
Geometric simplification for indirect illumination calculations
- Rushmeier, Patterson, et al.
- 1993
(Show Context)
Citation Context ... radiosity algorithm did not address the “clustering” problem of efficiently handling interactions among surfaces composed of many small surfaces; some techniques have been recently proposed to do so =-=[20, 22, 29]-=-. • Meshing and Finite Element Methods. Finally, meshing and finite-element techniques have been employed to improve the accuracy of radiosity solutions. Classical and hierarchical solution algorithms... |

33 |
Real Time Radiosity Through Parallel Processing and Hardware Acceleration
- BAUM, WINGET
- 1990
(Show Context)
Citation Context ... bookkeeping, since each shoot updates many brightnesses, and the relative priorities of queued shooters may change considerably. Parallel implementations of progressive refinement have been reported =-=[2, 19]-=-. “Super-shoot gather” techniques repeatedly (over)shoot from and gather to a small number of surfaces, ignoring any interactions not involving the shooters [7, 12]. • Hierarchical Approaches and Clus... |

32 | Database and Display Algorithms for Interactive Visualization of Architectural Models
- Funkhouser
- 1993
(Show Context)
Citation Context ...ity of California, Berkeley Computer Science Building. The furnished building model contains more than 8,000 light sources and 1.4 million surfaces and requires approximately 350 megabytes of storage =-=[9]-=-. We estimate that 10 to 100 million elements may be required to represent a high-fidelity radiosity solution throughout the model. Intermediate memory demands often determine the limits on the size o... |

28 |
Finite element methods for global illumination
- Heckbert, Winget
- 1991
(Show Context)
Citation Context ...onstant over each surface. Galerkin-based methods use finite element techniques to represent radiosities more generally, as weighted sums of smoothly varying basis functions defined over each surface =-=[16, 17, 27, 30]-=-. The resulting solutions have better smoothness and convergence behavior than those of classical radiosity. Recently, the wavelet radiosity method [13, 21] combined hierarchical radiosity with Galerk... |

26 |
Radiosity Algorithms Using Higher Order Finite Element Methods
- TROUTMAN, MAX
- 1993
(Show Context)
Citation Context |

21 |
Accelerated radiosity method for complex environments
- XU, PENG, et al.
- 1990
(Show Context)
Citation Context ... radiosity algorithm did not address the “clustering” problem of efficiently handling interactions among surfaces composed of many small surfaces; some techniques have been recently proposed to do so =-=[20, 22, 29]-=-. • Meshing and Finite Element Methods. Finally, meshing and finite-element techniques have been employed to improve the accuracy of radiosity solutions. Classical and hierarchical solution algorithms... |

17 | Radiosity and Relaxation Methods: Progressive Refinement is Southwell Relaxation," Princeton University Research Report CS-TR-408-93
- Gortler, Cohen, et al.
- 1993
(Show Context)
Citation Context ...ssive refinement have been reported [2, 19]. “Super-shoot gather” techniques repeatedly (over)shoot from and gather to a small number of surfaces, ignoring any interactions not involving the shooters =-=[7, 12]-=-. • Hierarchical Approaches and Clustering. Matrix-based solutions consider the matrix at a single granularity, namely the correspondence between each matrix entry and pair of surfaces in the environm... |

12 |
Accelerating Radiosity by Overshooting
- Feda
- 1992
(Show Context)
Citation Context ...ssive refinement have been reported [2, 19]. “Super-shoot gather” techniques repeatedly (over)shoot from and gather to a small number of surfaces, ignoring any interactions not involving the shooters =-=[7, 12]-=-. • Hierarchical Approaches and Clustering. Matrix-based solutions consider the matrix at a single granularity, namely the correspondence between each matrix entry and pair of surfaces in the environm... |

11 |
Experiments on Geometric Travelling Salesman Heuristics
- Bentley
- 1990
(Show Context)
Citation Context ...putations on very large models. We are currently investigating other possible ordering algorithms, including ones derived from progressive radiosity [5], nearest neighbors, and minimum spanning trees =-=[3]-=-. We expect that the best ordering algorithms will take into account both cache coherence and convergence behavior. Elapsed Time (seconds) 40000 30000 20000 10000 0 Solver I/0 Random Model Source Cell... |

6 | Predetermining Visibility Priority in 3-D Scenes
- Fuchs, Kedem, et al.
- 1979
(Show Context)
Citation Context ...luster that has been visible to many previous receivers is likely to have a large overlap with the current working set. • Cell order schedules clusters by traversing cells of the wallaligned BSP-tree =-=[8]-=- spatial subdivision [23, 26]. Consecutive cells are chosen by selecting the neighbor cell whose intervening boundary has the largest transparent area. This approach exploits the visibility coherence ... |

5 |
Image and intervisibility coherence in rendering
- Marks, Walsh, et al.
- 1990
(Show Context)
Citation Context ...al visibility into a collection of visibility subspaces by generating a common shaft volume for each interacting pair, and treating as blockers only those objects (potentially) intersecting the shaft =-=[14, 18]-=-. Finally, preprocessing and incremental maintenance techniques used a coherent global pass through the model to generate initial blocker lists, then maintained the lists incrementally under link subd... |

1 |
A Methodology for Geometric Algorithm Development
- Teller
- 1993
(Show Context)
Citation Context ...itial blocker list for each tube. • The visualization module employs the Silicon Graphics IRIS GL tm to facilitate interaction, inspection, and animation of ?sgeometric data structures and algorithms =-=[24]-=-. It has proven indispensable to developing a working system. 5 Partitioning We wish to partition a huge radiosity computation into a sequence of small gathers to individual receivers, each of which c... |

1 | Time Radiosity Through Parallel Processing and Hardware Acceleration - Real - 1990 |

1 | Computer Graphics (Proc. Siggraph ’93 - radiosity - 1993 |

1 | radiosity: A higher order solution method for global illumination - Galerkin - 1993 |