Intersection Curve Computation
Intersection Curve Computation is a computational method in geometric modeling that determines the set of points common to two or more implicitly or parametrically defined surfaces by solving their Boolean intersection through numerical or symbolic techniques.
138
Publications
7.1K
Citations
243
Authors
134
Institutions
Publications per year
2017–2026
10
Parents
138
Strip trees: a hierarchical representation for curves
Dana H. Ballard · Communications of the ACM · 1981 · 236 citations · Full text
Ray tracing parametric patches
James T. Kajiya · 1982 · 211 citations
Ray tracing trimmed rational surface patches
Tomoyuki Nishita, Thomas W. Sederberg, Masanori Kakimoto · 1990 · 204 citations
1–5 of 138
243
11
h-index
6
h-index
5
h-index
University of North Carolina at Chapel Hill, United States
5 publications · 274 citations
5
h-index
Massachusetts Institute of Technology, United States
5 publications · 233 citations
5
h-index
1–5 of 243
134
Brigham Young University
Provo, United States
11 h-index
19 publications
1.4K citations

University of Hong Kong
Pok Fu Lam, Hong Kong
8 h-index
11 publications
311 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
14 publications
612 citations

Chinese Academy of Sciences
Beijing, China
5 h-index
7 publications
221 citations
Seoul National University
Seoul, South Korea
5 h-index
10 publications
223 citations
Shandong University
Jinan, China
4 h-index
7 publications
141 citations
Rensselaer Polytechnic Institute
Troy, United States
4 h-index
5 publications
430 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
4 h-index
4 publications
80 citations
1–8 of 134
20 publications · 950 citations
17
h-index
15 publications · 755 citations
15
h-index
6 publications · 445 citations
6
h-index
6 publications · 239 citations
6
h-index
4 publications · 80 citations
3
h-index
1–5