mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Fast and Tight Fitting Bounding Spheres
Mälardalen University, School of Innovation, Design and Engineering.ORCID iD: 0000-0002-1550-0994
2008 (English)In: Proceedings of the Annual SIGRAD Conference, Stockholm, Linköping: Linköping University Electronic Press, 2008, Vol. 34, p. 27-30Conference paper, Published paper (Refereed)
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

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2008. Vol. 34, p. 27-30
Series
Linköping Electronic Conference Proceedings, ISSN 1650-3686, E-ISSN 1650-3740 ; 34
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:mdh:diva-7248OAI: oai:DiVA.org:mdh-7248DiVA, id: diva2:237258
Conference
SIGRAD 2008. The Annual SIGRAD Conference Special Theme: Interaction; November 27-28; 2008 Stockholm; Sweden
Available from: 2009-09-25 Created: 2009-09-25 Last updated: 2017-06-27Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

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

Authority records BETA

Larsson, Thomas

Search in DiVA

By author/editor
Larsson, Thomas
By organisation
School of Innovation, Design and Engineering
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 54 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf