Article

Fast approximate ambient occlusion

Authors:

Gilles Cadet,

Bernard LécussanAuthors Info & Claims

SIGGRAPH '07: ACM SIGGRAPH 2007 posters

Pages 191 - es

https://doi.org/10.1145/1280720.1280926

Published: 05 August 2007 Publication History

Get Access

Abstract

No abstract available.

References

[1]

Christensen P. H., Fong J., Laur D. M. and Batali D.: Ray Tracing for the Movie 'Cars'. Proceedings of the IEEE Symposium on Interactive Ray Tracing 2006, pages 1--6. IEEE, September 2006.

Google Scholar

[2]

Kontkanen J., Laine S.: Ambient occlusion fields. In Proc. I3D (2005), ACM Press, pp. 41--48.

Crossref

Google Scholar

[3]

Landis H.: Production-ready global illumination. In SIGGRAPH 2002 course note #16, pages 87--102, 2002.

Google Scholar

[4]

Malmer M., Malmer F., Assarsson U., Holzschuch N.: Fast Precomputed Ambient Occlusion for Proximity Shadows. Tech. Rep. RR-5779, INRIA, 2005.

Google Scholar

[5]

Pharr M.: Ambient occlusion. In GPU Gems (2004), Fernando R., (Ed.), Addison Wesley, pp. 667--692.

Google Scholar

[6]

Zhukov S., Iones A., Kronin G.: An ambient light illumination model. In Rendering Techniques '98 (Proc. EGWR) (1998), pp. 45--55.

Crossref

Google Scholar

Recommendations

Fast approximate probabilistically checkable proofs

We investigate the question of when a verifier, with the aid of a proof, can reliably compute a function faster than it can without the proof. The proof system model that we use is based on a variant of the Probabilistically Checkable Proofs (PCP) model,...
Occlusion Detectable Stereo -- Occlusion Patterns in Camera Matrix
CVPR '96: Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)

In stereo algorithms with more than two cameras, the improvement of accuracy is often reported since they are robust against noise. However, another important aspect of the polynocular stereo, that is the ability of occlusion detection, has been paid ...
Hardness of Approximate Hypergraph Coloring

We introduce the notion of covering complexity of a verifier for probabilistically checkable proofs (PCPs). Such a verifier is given an input, a claimed theorem, and an oracle, representing a purported proof of the theorem. The verifier is also given a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGGRAPH '07: ACM SIGGRAPH 2007 posters

August 2007

197 pages

ISBN:9781450318280

DOI:10.1145/1280720

Conference Chairs:
Marc Alexa
Technische Universitat Berlin
,
Adam Finkelstein
Princeton University

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 August 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGGRAPH07

Sponsor:

SIGGRAPH

SIGGRAPH07: Special Interest Group on Computer Graphics and Interactive Techniques Conference

August 5 - 9, 2007

California, San Diego

Acceptance Rates

Overall Acceptance Rate 1,822 of 8,601 submissions, 21%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Nov 2024

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Recommendations

Fast approximate probabilistically checkable proofs

Occlusion Detectable Stereo -- Occlusion Patterns in Camera Matrix

Hardness of Approximate Hypergraph Coloring