Parallel computation of optimal enclosing balls by iterative orthant scan-Reference-Cited by-同舟云学术

Parallel computation of optimal enclosing balls by iterative orthant scan

Published:2016-05 Issue: Volume:56 Page:1-10
ISSN:0097-8493
Container-title:Computers & Graphics
language:en
Short-container-title:Computers & Graphics

Author:

Larsson Thomas,Capannini Gabriele,Källberg Linus

Publisher

Elsevier BV

Subject

Computer Graphics and Computer-Aided Design,Human-Computer Interaction,General Engineering

Reference54 articles.

1. Adaptive medial-axis approximation for sphere-tree construction;Bradshaw;ACM Trans Graph,2004

2. The minimum covering sphere problem;Elzinga;Manag Sci,1972

3. Gottschalk S, Lin MC, Manocha D. OBBTree: a hierarchical structure for rapid interference detection. In: Proceedings of the 23rd annual conference on computer graphics and interactive techniques; 1996. p. 171–80.

4. Katayama N, Satoh S. The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of the 1997 ACM SIGMOD international conference on Management of data; 1997. p. 369–80.

5. Larsson T. Adaptive bounding volume hierarchies for efficient collision queries [Ph.D. thesis]. Mälardalen University, Sweden: School of Innovation, Design and Engineering; 2009.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A branch-and-bound method for the minimum k−enclosing ball problem;Operations Research Letters;2022-05

2. ParGeo;Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2022-03-28

3. A hybrid algorithm for the minimum bounding sphere problem;Operations Research Letters;2022-03

4. A dual simplex-type algorithm for the smallest enclosing ball of balls;Computational Optimization and Applications;2021-05-26

5. A faster dual algorithm for the Euclidean minimum covering ball problem;Annals of Operations Research;2018-12-18