Parallel Approximation Algorithms For Geometry
Parallel Approximation Algorithms for Geometry is a computational framework within algorithmic geometry that employs parallel processing to efficiently compute approximate solutions to geometric problems, distinguished by its focus on achieving near-optimal results in reduced time through concurrent computation.
21
Publications
1.3K
Citations
53
Authors
24
Institutions
Publications per year
2017–2026
2
21
Symposium on geometry processing
Computers & Graphics · 2006 · 267 citations
Symposium on Geometry Processing
Leif Kobbelt, Peter Schöder, Hugues Hoppe · Computer Graphics Forum · 2004 · 164 citations
1–5 of 21
53
3
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 53
24

Australian National University
Canberra, Australia
2 h-index
7 publications
242 citations
National University of Singapore
Singapore, Singapore
1 h-index
4 publications
96 citations

Johns Hopkins University
Baltimore, United States
1 h-index
1 publications
33 citations
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
5 publications
745 citations

Charles Sturt University
Bathurst, Australia
1 h-index
1 publications
12 citations
University of Stuttgart
Stuttgart, Germany
1 h-index
1 publications
91 citations
Redmond Fire Department
Redmond, United States
1 h-index
1 publications
164 citations
Alcatel Lucent (Germany)
Stuttgart, Germany
1 h-index
4 publications
196 citations
1–8 of 24
Conference · 3 publications · 88 citations
3
h-index
2 publications · 182 citations
2
h-index
2 publications · 344 citations
2
h-index
Conference · 1 publications · 16 citations
1
h-index
1 publications · 79 citations
1
h-index
1–5