mdh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Parallel computation of optimal enclosing balls by iterative orthant scan
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0002-1550-0994
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0002-6969-6793
2016 (engelsk)Inngår i: Computers & graphics, ISSN 0097-8493, E-ISSN 1873-7684, Vol. 56, s. 1-10Artikkel i tidsskrift (Fagfellevurdert) Published
Resurstyp
Text
Abstract [en]

We propose an algorithm for computing the exact minimum enclosing ball of large point sets in general dimensions. It aims to reduce the number of passes by retrieving a well-balanced set of outliers in each linear search through the input by decomposing the space into orthants. The experimental evidence indicates that the convergence rate in terms of the required number of linear passes is superior compared to previous exact methods, and substantially faster execution times are observed in dimensions d≤16. In the important three-dimensional case, the execution times indicate real-time performance. Furthermore, we show how the algorithm can be adapted for parallel execution on both CPU and GPU architectures using OpenMP, AVX, and CUDA. For large datasets, our CUDA solution is superior. For example, the benchmark results show that optimal bounding spheres for inputs with tens of millions of points can be computed in just a few milliseconds.

sted, utgiver, år, opplag, sider
2016. Vol. 56, s. 1-10
HSV kategori
Identifikatorer
URN: urn:nbn:se:mdh:diva-31461DOI: 10.1016/j.cag.2016.01.003ISI: 000375813900001Scopus ID: 2-s2.0-84962520463OAI: oai:DiVA.org:mdh-31461DiVA, id: diva2:922502
Tilgjengelig fra: 2016-04-22 Laget: 2016-04-22 Sist oppdatert: 2018-02-23bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Larsson, Thomas BKällberg, Linus

Søk i DiVA

Av forfatter/redaktør
Larsson, Thomas BCapannini, GabrieleKällberg, Linus
Av organisasjonen
I samme tidsskrift
Computers & graphics

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 32 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf