Line Visibility Algorithms
Line Visibility Algorithm is a computational method within the field of computer graphics that determines the visibility of line segments in a three-dimensional scene by distinguishing those that are obscured by surfaces or other geometric elements from those that remain visible to the observer.
18
Publications
2K
Citations
29
Authors
19
Institutions
Publications per year
2017–2026
0
Variants
Hidden Line AlgorithmsHidden Line Removal Algorithms
Parents
18
On visible surface generation by a priori tree structures
Henry Fuchs, Zvi M. Kedem, Bruce Naylor · 1980 · 698 citations · Full text
Computer processing of line images: A survey
Pattern Recognition · 1987 · 150 citations
Worst-case optimal hidden-surface removal
Michael McKenna · ACM Transactions on Graphics · 1987 · 144 citations · Full text
1–5 of 18
29
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 29
19

Johns Hopkins University
Baltimore, United States
2 h-index
2 publications
154 citations

TU Wien
Vienna, Austria
2 h-index
4 publications
116 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
2 h-index
2 publications
1K citations

Czech Technical University in Prague
Prague, Czechia
2 h-index
4 publications
86 citations
The University of Texas at Dallas
Richardson, United States
2 h-index
4 publications
2K citations

University of Bristol
Bristol, United Kingdom
1 h-index
1 publications
150 citations
Graz University of Technology
Graz, Austria
1 h-index
1 publications
296 citations
Princeton University
Princeton, United States
1 h-index
2 publications
36 citations
1–8 of 19
1 publications · 28 citations
1
h-index
1 publications · 21 citations
1
h-index
1 publications · 86 citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 150 citations
1
h-index
1–5