Thomas Larsson

Orcid: 0000-0002-1550-0994

According to our database1, Thomas Larsson authored at least 27 papers between 2001 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Adaptive Collision Culling for Massive Simulations by a Parallel and Context-Aware Sweep and Prune Algorithm.
IEEE Trans. Vis. Comput. Graph., 2018

2016
Towards a compositional service architecture for real-time cloud robotics: invited paper.
SIGBED Rev., 2016

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, 2016

Parallel computation of optimal enclosing balls by iterative orthant scan.
Comput. Graph., 2016

Towards Full-Scale Ray Tracing in Games.
Proceedings of SIGRAD 2016, Visual Computing, May 23-24, 2016, Visby, Sweden, 2016

Output Sensitive Collision Detection for Unisize Boxes.
Proceedings of SIGRAD 2016, Visual Computing, May 23-24, 2016, Visby, Sweden, 2016

Efficient collision culling by a succinct bi-dimensional sweep and Prune algorithm.
Proceedings of the 32nd Spring Conference on Computer Graphics, 2016

An External Memory Algorithm for the Minimum Enclosing Ball Problem.
Proceedings of the 11th Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2016), 2016

Adaptive Collision Culling for Large-Scale Simulations by a Parallel Sweep and Prune Algorithm.
Proceedings of the 16th Eurographics Symposium on Parallel Graphics and Visualization, 2016

A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Exact Bounding Spheres by Iterative Octant Scan.
Proceedings of SIGRAD 2015, Visual Computing, June 1-2, 2015, Stockholm, Sweden, 2015

2014
Improved pruning of large data sets for the minimum enclosing ball problem.
Graph. Model., 2014

Accelerated Computation of Minimum Enclosing Balls by GPU Parallelization and Distance Filtering.
Proceedings of SIGRAD 2014, Visual Computing, June 12-13, 2014, Göteborg, Sweden, 2014

A cascade classifier for diagnosis of melanoma in clinical images.
Proceedings of the 36th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2014

2013
Faster Approximation of Minimum Enclosing Balls by Distance Filtering and GPU Parallelization.
J. Graph. Tools, 2013

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions.
Comput. Graph. Forum, 2013

2010
Parallel Construction of Bounding Volumes.
Proceedings of SIGRAD 2010: Content aggregation and visualization, 2010

Ray Tracing using Hierarchies of Slab Cut Balls.
Proceedings of the 31st Annual Conference of the European Association for Computer Graphics, 2010

2009
Adaptive Bounding Volume Hierarchies for Efficient Collision Queries.
PhD thesis, 2009

Bounding Volume Hierarchies of Slab Cut Balls.
Comput. Graph. Forum, 2009

2008
An Efficient Ellipsoid-OBB Intersection Test.
J. Graph. Tools, 2008

Vignettes of Sweden's Computer Graphics History.
IEEE Ann. Hist. Comput., 2008

2007
On Faster Sphere-Box Overlap Testing.
J. Graph. Tools, 2007

2006
A dynamic bounding volume hierarchy for generalized collision detection.
Comput. Graph., 2006

2005
The Data Surface Interaction Paradigm.
Proceedings of the EG UK Theory and Practice of Computer Graphics, 2005

2003
Efficient collision detection for models deformed by morphing.
Vis. Comput., 2003

2001
Collision Detection for Continuously Deforming Bodies.
Proceedings of the 22nd Annual Conference of the European Association for Computer Graphics, 2001


  Loading...