Output-sensitive Algorithms
Output-Sensitive Algorithms is an algorithmic paradigm in computational geometry that belongs to the class of algorithms whose runtime complexity is characterized not only by the size of the input but explicitly in addition by the size of the output, thereby distinguishing it from traditional algorithms that depend solely on input parameters.
97
Publications
3.8K
Citations
173
Authors
97
Institutions
Publications per year
2017–2026
6
Parents
97
Doug L. James, Dinesh K. Pai · ACM Transactions on Graphics · 2004 · 206 citations
The randomized z-buffer algorithm
Michael Wand, Matthias Fischer, Ingmar Peter et al. · 2001 · 127 citations
1–5 of 97
173
5
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 173
97

Tel Aviv University
Tel Aviv, Israel
6 h-index
9 publications
202 citations

University of British Columbia
Vancouver, Canada
5 h-index
7 publications
362 citations
New York University
New York, United States
5 h-index
7 publications
378 citations
Utrecht University
Utrecht, The Netherlands
5 h-index
12 publications
238 citations

University of Waterloo
Waterloo, Canada
4 h-index
4 publications
110 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
9 publications
437 citations

Johns Hopkins University
Baltimore, United States
4 h-index
6 publications
112 citations
Simon Fraser University
Burnaby, Canada
3 h-index
5 publications
65 citations
1–8 of 97
Conference · 5 publications · 112 citations
5
h-index
5 publications · 375 citations
5
h-index
TOG · 4 publications · 343 citations
4
h-index
4 publications · 356 citations
4
h-index
TVCG · 3 publications · 108 citations
3
h-index
1–5