Parallel Combinatorial Geometry
Parallel Combinatorial Geometry is a computational framework within parallel computational geometry that specifically addresses the decomposition, arrangement, and intersection of discrete geometric objects using concurrent algorithms to enhance computational efficiency.
8
Publications
783
Citations
29
Authors
11
Institutions
Publications per year
2017–2026
2
8
A high fidelity general purpose 3-D Monte Carlo particle transport program JMCT3.0
Deng Li, Gang Li, Baoyin Zhang et al. · Nuclear Science and Techniques · 2022 · 26 citations · Full text
Computing, Computer Science, Physics +17
1–5 of 8
29
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 29
11
University of Washington
Seattle, United States
1 h-index
1 publications
22 citations
University of California, Irvine
Irvine, United States
1 h-index
1 publications
32 citations
Center for Massive Data Algorithmics
Aarhus, Denmark
1 h-index
2 publications
64 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
1 publications
146 citations
Numerical Method (China)
Tsuen Wan, China
1 h-index
12 publications
312 citations
Institute of Applied Physics and Computational Mathematics
Beijing, China
1 h-index
6 publications
156 citations

University of Rochester
Rochester, United States
1 h-index
1 publications
39 citations
University at Buffalo, State University of New York
Buffalo, United States
1 h-index
1 publications
10 citations
1–8 of 11
2 publications · 32 citations
2
h-index
LNCS · Book series · 1 publications · 146 citations
1
h-index
NST · 1 publications · 26 citations
1
h-index
Conference · 1 publications · 19 citations
1
h-index
1 publications · 489 citations
1
h-index
1–5