mdh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Fast and Tight Fitting Bounding Spheres
Mälardalens högskola, Akademin för innovation, design och teknik.ORCID-id: 0000-0002-1550-0994
2008 (Engelska)Ingår i: Proceedings of the Annual SIGRAD Conference, Stockholm, Linköping: Linköping University Electronic Press, 2008, Vol. 34, s. 27-30Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]
  • Abstract
  • References
  • Citations in
  • Citations in Google Scholar

Bounding spheres are utilized frequently in many computer graphics and visualization applications; and it is not unusual that the computation of the spheres has to be done during run-time at real-time rates. In this paper; an attractive algorithm for computing bounding spheres under such conditions is proposed. The method is based on selecting a set of k extremal points along s = k/2 input directions. In general; the method is able to compute better fitting spheres than Ritter’s algorithm at roughly the same speed. Furthermore; the algorithm computes almost optimal spheres significantly faster than the best known smallest enclosing ball methods. Experimental evidence is provided which illustrates the qualities of the approach as compared to five other competing methods. Also; the experimental result gives insight into how the parameter s affects the tightness of fit and computation speed.

CR Categories: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—Geometrical problems and computations; I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling

Keywords: Bounding sphere; enclosing ball; extremal points; computational geometry; computer graphics

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University Electronic Press, 2008. Vol. 34, s. 27-30
Serie
Linköping Electronic Conference Proceedings, ISSN 1650-3686, E-ISSN 1650-3740 ; 34
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:mdh:diva-7248OAI: oai:DiVA.org:mdh-7248DiVA, id: diva2:237258
Konferens
SIGRAD 2008. The Annual SIGRAD Conference Special Theme: Interaction; November 27-28; 2008 Stockholm; Sweden
Tillgänglig från: 2009-09-25 Skapad: 2009-09-25 Senast uppdaterad: 2017-06-27Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

http://www.ep.liu.se/ecp/034/009/ecp083409.pdf

Personposter BETA

Larsson, Thomas

Sök vidare i DiVA

Av författaren/redaktören
Larsson, Thomas
Av organisationen
Akademin för innovation, design och teknik
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 175 träffar
RefereraExporteraLänk till posten
Permanent länk

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