Adams, BartKeiser, RichardPauly, MarkGuibas, Leonidas J.Gross, MarkusDutre, Philip2010-06-142010-06-142010-06-14200510.1111/j.1467-8659.2005.00892.xhttps://infoscience.epfl.ch/handle/20.500.14299/50766We present efficient data structures and caching schemes to accelerate ray-surface intersections for deforming point-sampled surfaces. By exploiting spatial and temporal coherence of the deformation during the animation, we are able to improve rendering performance by a factor of two to three compared to existing techniques. Starting from a tight bounding sphere hierarchy for the undeformed object, we use a lazy updating scheme to adapt the hierarchy to the deformed surface in each animation step. In addition, we achieve a significant speedup for ray-surface intersections by caching per-ray intersection points. We also present a technique for rendering sharp edges and corners in point-sampled models by introducing a novel surface clipping algorithm. © The Eurographics Association and Blackwell Publishing 2005.Algorithmic languagesAnimationComputational geometryData structuresEdge detectionHierarchical systemsSurface topographytext::journal::journal article::research article