Intersection Queries
Intersection Queries is an algorithmic framework in computational geometry that enables efficient determination of spatial overlaps between geometric entities by systematically identifying pairs of objects whose boundaries intersect within a given dataset.
231
Publications
14.9K
Citations
452
Authors
202
Institutions
Publications per year
2017–2026
19
Parents
231
Fast, Minimum Storage Ray-Triangle Intersection
Tomas Möller, Ben Trumbore · Journal of Graphics Tools · 1997 · 1K citations
Algorithms for Reporting and Counting Geometric Intersections
Bentley, Ottmann · IEEE Transactions on Computers · 1979 · 999 citations
Timothy L. Kay, James T. Kajiya · ACM SIGGRAPH Computer Graphics · 1986 · 463 citations · Full text
1–5 of 231
452
University of North Carolina at Chapel Hill, United States
19 publications · 1.5K citations
18
h-index
University of North Carolina at Chapel Hill, United States
10 publications · 1.1K citations
10
h-index
9
h-index
7
h-index
7
h-index
1–5 of 452
202
University of North Carolina at Chapel Hill
Chapel Hill, United States
16 h-index
47 publications
3.7K citations
Princeton University
Princeton, United States
9 h-index
12 publications
659 citations

University of Minnesota
Minneapolis, United States
8 h-index
11 publications
335 citations
Graz University of Technology
Graz, Austria
6 h-index
8 publications
431 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
10 publications
1.6K citations
Stanford University
Stanford, United States
5 h-index
8 publications
631 citations
University of Maryland, College Park
College Park, United States
5 h-index
7 publications
590 citations
Stony Brook University
Stony Brook, United States
5 h-index
11 publications
2.9K citations
1–8 of 202
10 publications · 305 citations
10
h-index
7 publications · 443 citations
7
h-index
7 publications · 289 citations
7
h-index
6 publications · 377 citations
6
h-index
TKDE · 4 publications · 218 citations
5
h-index
1–5