Parallel External Memory Geometric Algorithms
Parallel External Memory Geometric Algorithms is a class of geometric algorithms designed to solve computational geometry problems efficiently by exploiting parallelism across multiple processors while explicitly managing data transfers between internal memory and external storage to minimize input/output costs.
17
Publications
722
Citations
35
Authors
21
Institutions
Publications per year
2017–2026
1
17
External-memory computational geometry
Michael T. Goodrich, Jyh-Jong Tsay, Darren Erik Vengroff et al. · 2002 · 197 citations · Full text
1–5 of 17
35
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 35
21

Johns Hopkins University
Baltimore, United States
3 h-index
5 publications
639 citations
Rensselaer Polytechnic Institute
Troy, United States
2 h-index
4 publications
112 citations
National Chung Cheng University
Minxiong, Taiwan
2 h-index
3 publications
405 citations
Duke University
Durham, United States
2 h-index
4 publications
416 citations

Universidade Federal de Viçosa
Viçosa, Brazil
2 h-index
7 publications
151 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
2 h-index
4 publications
166 citations
Brown University
Providence, United States
1 h-index
2 publications
394 citations

Carleton University
Ottawa, Canada
1 h-index
3 publications
66 citations
1–8 of 21
2 publications · 77 citations
2
h-index
1 publications · 106 citations
1
h-index
1 publications · 33 citations
1
h-index
Repository · 1 publications · 28 citations
1
h-index
Conference · 1 publications · 49 citations
1
h-index
1–5