Computational Intersection Algorithms
Computational Intersection Algorithms is a class of algorithmic methods in computational geometry that specifically address the determination and analysis of intersection patterns between geometric surface representations through numerical and symbolic computation techniques.
209
Publications
10.9K
Citations
368
Authors
196
Institutions
Publications per year
2017–2026
18
Parents
209
Fast, Minimum Storage Ray-Triangle Intersection
Tomas Möller, Ben Trumbore · Journal of Graphics Tools · 1997 · 1K citations
Fast, minimum storage ray/triangle intersection
Tomas Möller, Ben Trumbore · 2005 · 295 citations
1–5 of 209
368
9
h-index
University of Illinois Urbana-Champaign, United States
7 publications · 810 citations
7
h-index
University of North Carolina at Chapel Hill, United States
4 publications · 252 citations
4
h-index
4
h-index
4
h-index
1–5 of 368
196
Princeton University
Princeton, United States
8 h-index
9 publications
797 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
5 h-index
9 publications
174 citations

Cornell University
Ithaca, United States
5 h-index
8 publications
1.5K citations

University of Hong Kong
Pok Fu Lam, Hong Kong
5 h-index
5 publications
177 citations
Brigham Young University
Provo, United States
4 h-index
6 publications
436 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
7 publications
316 citations
Chalmers University of Technology
Gothenburg, Sweden
4 h-index
4 publications
1.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
5 publications
268 citations
1–8 of 196
JGT · 9 publications · 1.5K citations
9
h-index
9 publications · 383 citations
9
h-index
8 publications · 252 citations
8
h-index
5 publications · 385 citations
5
h-index
5 publications · 117 citations
5
h-index
1–5