default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Larsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j13]Gabriele Capannini
, Thomas Larsson:
Adaptive Collision Culling for Massive Simulations by a Parallel and Context-Aware Sweep and Prune Algorithm. IEEE Trans. Vis. Comput. Graph. 24(7): 2064-2077 (2018)- 2016
- [j12]Thomas Larsson, Gabriele Capannini, Linus Källberg:
Parallel computation of optimal enclosing balls by iterative orthant scan. Comput. Graph. 56: 1-10 (2016) - [j11]Anna Stålberg, Anette Sandberg, Maja Söderbäck, Thomas Larsson:
The child's perspective as a guiding principle: Young children as co-designers in the design of an interactive application meant to facilitate participation in healthcare situations. J. Biomed. Informatics 61: 149-158 (2016) - [j10]Shahina Begum, Moris Behnam, Thomas Larsson, Thomas Nolte, Kristian Sandström:
Towards a compositional service architecture for real-time cloud robotics: invited paper. SIGBED Rev. 13(3): 63-64 (2016) - [c13]Linus Källberg, Thomas Larsson:
A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids. COCOA 2016: 744-753 - [c12]Gabriele Capannini, Thomas Larsson:
Adaptive Collision Culling for Large-Scale Simulations by a Parallel Sweep and Prune Algorithm. EGPGV@EuroVis 2016: 1-10 - [c11]Linus Källberg, Evan Shellshear, Thomas Larsson:
An External Memory Algorithm for the Minimum Enclosing Ball Problem. VISIGRAPP (1: GRAPP) 2016: 83-90 - [c10]Gabriele Capannini, Thomas Larsson:
Efficient collision culling by a succinct bi-dimensional sweep and Prune algorithm. SCCG 2016: 25-32 - [c9]Gabriele Capannini, Thomas Larsson:
Output Sensitive Collision Detection for Unisize Boxes. SIGRAD 2016: 127:004 - [c8]Afshin Ameri E, Thomas Larsson:
Towards Full-Scale Ray Tracing in Games. SIGRAD 2016: 127:009 - 2015
- [c7]Thomas Larsson:
Exact Bounding Spheres by Iterative Octant Scan. SIGRAD 2015: 120:003 - 2014
- [j9]Linus Källberg, Thomas Larsson:
Improved pruning of large data sets for the minimum enclosing ball problem. Graph. Model. 76(6): 609-619 (2014) - [c6]Peyman Sabouri, Hamid Gholamhosseini, Thomas Larsson, John Collins:
A cascade classifier for diagnosis of melanoma in clinical images. EMBC 2014: 6748-6751 - [c5]Linus Källberg, Thomas Larsson:
Accelerated Computation of Minimum Enclosing Balls by GPU Parallelization and Distance Filtering. SIGRAD 2014: 57-65 - 2013
- [j8]Thomas Larsson, Linus Källberg:
Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions. Comput. Graph. Forum 32(5): 93-101 (2013) - [j7]Linus Källberg, Thomas Larsson:
Faster Approximation of Minimum Enclosing Balls by Distance Filtering and GPU Parallelization. J. Graph. Tools 17(3): 67-84 (2013) - 2011
- [e2]Thomas Larsson, Lars Kjelldahl, Kai-Mikael Jää-Aro:
Proceedings of SIGRAD 2011. Evaluations of Graphics and Visualization - Efficiency, Usefulness, Accessibility, Usability, November 17-18, 2011, KTH, Stockholm, Sweden. Linköping Electronic Conference Proceedings 65, Linköping University Electronic Press 2011 [contents] - 2010
- [c4]Linus Källberg, Thomas Larsson:
Ray Tracing using Hierarchies of Slab Cut Balls. Eurographics (Short Papers) 2010: 69-72 - [c3]Mattias Karlsson, Olov Winberg, Thomas Larsson:
Parallel Construction of Bounding Volumes. SIGRAD 2010: 65-69 - [e1]Kai-Mikael Jää-Aro, Thomas Larsson:
Proceedings of SIGRAD 2010: Content aggregation and visualization, November 25-26, 2010, Västerås, Sweden. Linköping Electronic Conference Proceedings 52, Linköping University Electronic Press 2010 [contents]
2000 – 2009
- 2009
- [b1]Thomas Larsson:
Adaptive Bounding Volume Hierarchies for Efficient Collision Queries. Mälardalen University, Sweden, 2009 - [j6]Thomas Larsson, Tomas Akenine-Möller:
Bounding Volume Hierarchies of Slab Cut Balls. Comput. Graph. Forum 28(8): 2379-2395 (2009) - 2008
- [j5]Thomas Larsson, Ulf Stenlund:
Vignettes of Sweden's Computer Graphics History. IEEE Ann. Hist. Comput. 30(1): 50-58 (2008) - [j4]Thomas Larsson:
An Efficient Ellipsoid-OBB Intersection Test. J. Graph. Tools 13(1): 31-43 (2008) - 2007
- [j3]Thomas Larsson, Tomas Akenine-Möller, Eric Lengyel:
On Faster Sphere-Box Overlap Testing. J. Graph. Tools 12(1): 3-8 (2007) - 2006
- [j2]Thomas Larsson, Tomas Akenine-Möller:
A dynamic bounding volume hierarchy for generalized collision detection. Comput. Graph. 30(3): 450-459 (2006) - 2005
- [c2]Rikard Lindell, Thomas Larsson:
The Data Surface Interaction Paradigm. TPCG 2005: 155-162 - 2003
- [j1]Thomas Larsson, Tomas Akenine-Möller:
Efficient collision detection for models deformed by morphing. Vis. Comput. 19(2-3): 164-174 (2003) - 2001
- [c1]Thomas Larsson, Tomas Akenine-Möller:
Collision Detection for Continuously Deforming Bodies. Eurographics (Short Presentations) 2001
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
