## EFFICIENT UNIFORM GRIDS FOR COLLISION HANDLING IN MEDICAL SIMULATORS

### BibTeX

@MISC{Gissler_efficientuniform,

author = {Marc Gissler and Markus Ihmsen and Matthias Teschner},

title = {EFFICIENT UNIFORM GRIDS FOR COLLISION HANDLING IN MEDICAL SIMULATORS},

year = {}

}

### OpenURL

### Abstract

spatial data structures; collision detection; collision response; cell indexing; spatial hashing; cuckoo hashing; We investigate spatial acceleration structures within collision handling in scenarios with ”worst-case ” spatial layout. These are scenarios where lots of collisions and interactions persist over large time intervals. We focus on acceleration structures based on uniform grids and assess their efficiency in construction, update and query. Z-curves as a technique for the mapping of spatial locality to uniform grids are analyzed to improve the cache-hit rate. Approximate solutions based on the grid representation are considered and discussed in the context of time-critical collision handling. The findings are applied to a deformable collision framework. Experiments are performed on scenarios that are typical for medical simulators. They often exhibit the ”worst case ” spatial layout mentioned above. 1

### Citations

554 |
Validity of the single processor approach to achieving large-scale computing capabilities
- Amdahl
- 1967
(Show Context)
Citation Context ...ain amount of additional cores, e. g. additional loops over data arrays. Third, certain portions of an algorithm cannot be parallelized. According to Amdahl‘s law, this limits the achievable speedup (=-=Amdahl, 1967-=-). For example, if 90 percent of the algorithm can be parallelized, the maximum speedup is 10, regardless of the number of cores. Note that the law assumes that the problem size remains the same when ... |

245 | Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs - Klosowski, Held, et al. - 1998 |

193 | Approximating polyhedra with spheres for time-critical collision detection
- Hubbard
- 1996
(Show Context)
Citation Context ...nd query performance of the spatial acceleration structures could be improved. Time-critical collision handling is a research topic that is concerned with time constraints at the expense of accuracy (=-=Hubbard, 1996-=-). With respect to dynamics simulations, an approximate collision handling might still yield visually plausible results (O’Sullivan and Dingliana, 2001; Gissler et al., 2009). We focus on the research... |

157 |
Data structures for range searching
- Bentley, Friedman
- 1979
(Show Context)
Citation Context ...in and Manocha, 2003; Ericson, 2004; Teschner et al., 2005; Fares and Hammam, 2005; Kockara et al., 2007). A comprehensive survey on the underlying search methods and data structures can be found in (=-=Bentley and Friedman, 1979-=-). We focus on the discussion of approaches based on uniform grids. Uniform grids discretize kdimensional spaces into cells. (Levinthal, 1966) first applied grids to three-dimensional range queries. R... |

139 | Interactive Virtual Materials - Mueller, Gross - 2004 |

132 | Cuckoo hashing
- Pagh, Rodler
- 2001
(Show Context)
Citation Context ... maps are proposed for a compact representation of a three-dimensional grid. Many hashing techniques have been proposed such as perfect hashing (Fredman et al., 1984), multiplechoice perfect hashing (=-=Pagh and Rodler, 2004-=-) or combinations of both (Alcantara et al., 2009). In (Teschner. et al., 2003), an optimized spatial hashing technique for the collision detection of deformable objects is proposed. Space-filling cur... |

123 | Optimized spatial hashing for collision detection of deformable objects - Teschner, Heidelberger, et al. - 2003 |

103 |
Probabilistic algorithms
- Rabin
- 1976
(Show Context)
Citation Context ...ng. They propose an algorithm for which the performance does not depend on the primitive distribution, because the construction problem is reduced to sorting pairs of primitives and cell indices. In (=-=Rabin, 1976-=-), hash maps are proposed for a compact representation of a three-dimensional grid. Many hashing techniques have been proposed such as perfect hashing (Fredman et al., 1984), multiplechoice perfect ha... |

79 | Collision and proximity queries
- Lin, Manocha
(Show Context)
Citation Context ...WORK The problem of collision detection has been extensively studied in the areas of computer graphics, simulation, computational geometry and robotics. For excellent surveys, we refer thereader to (=-=Lin and Manocha, 2003-=-; Ericson, 2004; Teschner et al., 2005; Fares and Hammam, 2005; Kockara et al., 2007). A comprehensive survey on the underlying search methods and data structures can be found in (Bentley and Friedman... |

70 |
Real-Time Collision Detection
- Ericson
- 2005
(Show Context)
Citation Context ...lision detection has been extensively studied in the areas of computer graphics, simulation, computational geometry and robotics. For excellent surveys, we refer thereader to (Lin and Manocha, 2003; =-=Ericson, 2004-=-; Teschner et al., 2005; Fares and Hammam, 2005; Kockara et al., 2007). A comprehensive survey on the underlying search methods and data structures can be found in (Bentley and Friedman, 1979). We foc... |

70 | An algorithm for finding nearest neighbors - Friedman, Baskett, et al. - 1975 |

60 | Rt-deform: Interactive ray tracing of dynamic scenes using bvhs - Lauterbach, Yoon, et al. - 2006 |

53 | Hierarchical Data Structures and Algorithms for Computer Graphics II: Applications - Samet, Webber - 1988 |

52 | Collisions and perception - O’Sullivan, Dingliana |

48 | Global static indexing for real-time exploration of very large regular grids
- Pascucci, Frank
- 2001
(Show Context)
Citation Context ...an initial domain. In (Griebel and Zumbusch, 1998), SFCs as a method of ordering sparse rectangular grids were introduced. An efficient computation of the Lebesgue space filling curve is proposed in (=-=Pascucci and Frank, 2001-=-). We propose to employ SFCs for the computation of the cell index to increase the efficiency of the discussed collision handling approaches. 3 SPATIAL DATA STRUCTURES 3.1 Uniform grid A uniform grid ... |

43 | Collision Detection for Continuously Deforming Bodies - Larsson, Akenine-Möller - 2001 |

40 | János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time - Fredman - 1984 |

21 |
Molecular model-building by computer
- Levinthal
- 1966
(Show Context)
Citation Context ...ch methods and data structures can be found in (Bentley and Friedman, 1979). We focus on the discussion of approaches based on uniform grids. Uniform grids discretize kdimensional spaces into cells. (=-=Levinthal, 1966-=-) first applied grids to three-dimensional range queries. Recent research on uniform grids considers the memory requirements and parallelization techniques. (Lagae and Dutré, 2008) propose a compact r... |

18 | Hash-storage techniques for adaptive multilevel solvers and their parallelization, in Domain decomposition methods 10. The 10th int
- Griebel, Zumbusch
- 1996
(Show Context)
Citation Context ...ptimized spatial hashing technique for the collision detection of deformable objects is proposed. Space-filling curves (SFC) feature the ability to preserve spatial locality of an initial domain. In (=-=Griebel and Zumbusch, 1998-=-), SFCs as a method of ordering sparse rectangular grids were introduced. An efficient computation of the Lebesgue space filling curve is proposed in (Pascucci and Frank, 2001). We propose to employ S... |

16 |
Storing a Sparse Table with 0(1) Worst Case Access Time
- Fredman, Komlós, et al.
- 1984
(Show Context)
Citation Context ... of primitives and cell indices. In (Rabin, 1976), hash maps are proposed for a compact representation of a three-dimensional grid. Many hashing techniques have been proposed such as perfect hashing (=-=Fredman et al., 1984-=-), multiplechoice perfect hashing (Pagh and Rodler, 2004) or combinations of both (Alcantara et al., 2009). In (Teschner. et al., 2003), an optimized spatial hashing technique for the collision detect... |

16 | Real-time parallel hashing on the GPU - Alcantara, Sharf, et al. - 2009 |

12 |
A parallel algorithm for construction of uniform grids
- KALOJANOV, SLUSALLEK
- 2009
(Show Context)
Citation Context ...s considers the memory requirements and parallelization techniques. (Lagae and Dutré, 2008) propose a compact representation of uniform grids and discuss its application in GPU-based ray tracing. In (=-=Kalojanov and Slusallek, 2009-=-), efficient parallel grid construction is considered in the context of ray tracing. They propose an algorithm for which the performance does not depend on the primitive distribution, because the cons... |

10 | ICCD: Interactive continuous collision detection between deformable models using connectivitybased culling
- Tang, Curtis, et al.
- 2009
(Show Context)
Citation Context ...arious solutions exist to reduce the computational work in such cases. One is to keep the candidates for intersection tests to a minimum by optimizing the spatial partitioning or by improved culling (=-=Tang et al., 2008-=-). On the other hand, the construction, update and query performance of the spatial acceleration structures could be improved. Time-critical collision handling is a research topic that is concerned wi... |

8 | Compact, Fast and Robust Grids for Ray Tracing
- Lagae, Dutré
- 2008
(Show Context)
Citation Context ...sional spaces into cells. (Levinthal, 1966) first applied grids to three-dimensional range queries. Recent research on uniform grids considers the memory requirements and parallelization techniques. (=-=Lagae and Dutré, 2008-=-) propose a compact representation of uniform grids and discuss its application in GPU-based ray tracing. In (Kalojanov and Slusallek, 2009), efficient parallel grid construction is considered in the ... |

8 | HPCCD: Hybrid parallel continuous collision detection using CPUs and GPUs. Computer Graphics Forum - Kim, Heo, et al. - 2009 |

5 | Collision detection for rigid bodies: A state of the art review
- Fares, Hamam
- 2005
(Show Context)
Citation Context ...studied in the areas of computer graphics, simulation, computational geometry and robotics. For excellent surveys, we refer thereader to (Lin and Manocha, 2003; Ericson, 2004; Teschner et al., 2005; =-=Fares and Hammam, 2005-=-; Kockara et al., 2007). A comprehensive survey on the underlying search methods and data structures can be found in (Bentley and Friedman, 1979). We focus on the discussion of approaches based on uni... |

3 |
Time-critical collision handling for deformable modeling
- Gissler, Schmedding, et al.
(Show Context)
Citation Context ...aints at the expense of accuracy (Hubbard, 1996). With respect to dynamics simulations, an approximate collision handling might still yield visually plausible results (O’Sullivan and Dingliana, 2001; =-=Gissler et al., 2009-=-). We focus on the research areas of efficient data structures, parallel algorithms and approximate techniques. Our contribution: We investigate parallel data structures based on uniform grids in term... |

1 |
Collision detection: A survey
- Kockara, Halic, et al.
- 2007
(Show Context)
Citation Context ...computer graphics, simulation, computational geometry and robotics. For excellent surveys, we refer thereader to (Lin and Manocha, 2003; Ericson, 2004; Teschner et al., 2005; Fares and Hammam, 2005; =-=Kockara et al., 2007-=-). A comprehensive survey on the underlying search methods and data structures can be found in (Bentley and Friedman, 1979). We focus on the discussion of approaches based on uniform grids. Uniform gr... |

1 | Detection of collisions and self-collisions using image-space techniques - Gross - 2004 |