Photorealism in Computer Graphics 1992
DOI: 10.1007/978-3-662-09287-3_9
|View full text |Cite
|
Sign up to set email alerts
|

The Hemisphere Radiosity Method: A Tale of Two Algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

1993
1993
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 3 publications
0
6
0
Order By: Relevance
“…They have concluded that the hemicube algorithm is the fastest among these algorithms, but the accuracy of the hemicube algorithm stagnates when it is used for a large-scale model which includes a large number of finite elements. On the other hand, by modifying a hemisphere algorithm developed by Spencer [11], Doi [10] could generate graphics of the same quality as the graphics generated by the original hemisphere algorithm; the modified algorithm took only half the CPU time of the hemisphere algorithm. Their algorithm is based on the projection of elements to the bottom plane of a hemisphere through its great circle.…”
Section: Form Factormentioning
confidence: 99%
“…They have concluded that the hemicube algorithm is the fastest among these algorithms, but the accuracy of the hemicube algorithm stagnates when it is used for a large-scale model which includes a large number of finite elements. On the other hand, by modifying a hemisphere algorithm developed by Spencer [11], Doi [10] could generate graphics of the same quality as the graphics generated by the original hemisphere algorithm; the modified algorithm took only half the CPU time of the hemisphere algorithm. Their algorithm is based on the projection of elements to the bottom plane of a hemisphere through its great circle.…”
Section: Form Factormentioning
confidence: 99%
“…The number of projections were further reduced by using a single-plane projection (e.g. (Sillion and Puech, 1989)) or hemisphere (base) projections which, to our knowledge, were first proposed by (Spencer, 1992). In this case the projection is a simple normalization process and clipping can simply be performed against the base plane of the hemisphere.…”
Section: Projectionsmentioning
confidence: 99%
“…In this case the projection is a simple normalization process and clipping can simply be performed against the base plane of the hemisphere. To ensure an accurate projection, (Spencer, 1992) calculates the degree of the arc between pairs of points projected onto the hemisphere basis and uses this value to calculate intermediate points along the edge. A scan-conversion algorithm is then used to Table 1: Performance comparison between a CPU radiosity solver t cpu and our implementation (t gpu,cube for the hemicube and t gpu,sphere for the non-linear hemispherical projection with the speed-up in brackets).…”
Section: Projectionsmentioning
confidence: 99%
“…Such algorithms employ either analytical or probabilistic techniques, broadly referred to as Radiosity and Monte Carlo methods, respectively [4]. Prominent radiosity-based methods include the hemisphere method [5], the hemicube method [6] and adaptive integration [7]. Different implementations of the Monte Carlo method have been proposed since the 1960s.…”
Section: Introductionmentioning
confidence: 99%