15 search results - page 1 / 3 » Fast software for box intersections |
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
BIOINFORMATICS
2011
12 years 8 months ago
2011
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
VC
2008
13 years 4 months ago
2008
This paper presents a novel and fast image-space collision detection algorithm with the A-buffer, where the GPU computes the potentially colliding sets (PCSs), and the CPU performs...
WSCG
2001
13 years 6 months ago
2001
In any hierarchical radiosity method, the most expensive part is the evaluation of the visibility. Many methods use sampling and ray casting to determine this term. Space partitio...
DAGSTUHL
2003
13 years 6 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...