An efficient distance algorithm for interval‐based octree‐encoded CSG objects with time‐space coherence utilization
Eva Dyllong, Cornelius Grimm · PAMM · 2007
Abstract In this paper, a new distance algorithm for octree‐encoded CSG objects is presented. Interval vectors are used to describe the nodes of the octree for a reliable and efficient realization of the hierarchical data structure. The algorithm yields the lower bounds of the distance between the objects and is based on accurate algorithms that have been shown in [1], but involves interval arithmetic for reliable handling of rounding errors. Furthermore, time‐space coherence is utilized to increase the efficiency of sequential distance calculations. Experiments validate the approach and show its range of applicability. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)