Visibility Decomposition is a computational method in the field of visibility computation that partitions a geometric environment into distinct regions based on visibility properties, enabling efficient analysis and rendering by distinguishing areas with respect to occlusion and viewing conditions.
18
Publications
1.3K
Citations
46
Authors
28
Institutions
Publications per year
2017–2026
1
Parents
Publications
18
A rapid hierarchical radiosity algorithm
Pat Hanrahan, David Salzman, Larry Aupperle · 1991 · 519 citations
Computing, High-performance Computing, Computational Geometry +15
1–5 of 18
Authors
46
- LA
2
h-index
- DS
2
h-index
- PH
2
h-index
- GF
1
h-index
- SL
1
h-index
1–5 of 46
Institutions
28
Princeton University
Princeton, United States
2 h-index
4 publications
1.5K citations
North Bengal University
Siliguri, India
1 h-index
2 publications
74 citations
Purdue University West Lafayette
West Lafayette, United States
1 h-index
2 publications
20 citations
Johns Hopkins University
Baltimore, United States
1 h-index
1 publications
19 citations
IBM Research - Tokyo
Tokyo, Japan
1 h-index
1 publications
17 citations
University of Maryland, College Park
College Park, United States
1 h-index
3 publications
36 citations
Louisiana State University
Baton Rouge, United States
1 h-index
1 publications
15 citations
The University of Sydney
Sydney, Australia
1 h-index
1 publications
17 citations
1–8 of 28
Venues
- Concurrency Practice and Experience
1 publications · 12 citations
1
h-index
- Computer-Aided Design
1 publications · 24 citations
1
h-index
- Computer Graphics Forum
1 publications · 15 citations
1
h-index
- Theoretical Computer Science
1 publications · 17 citations
1
h-index
- UC Berkeley
Repository · 1 publications · 144 citations
1
h-index
1–5