Browsing 32-Issue 5 by Subject "Geometric algorithms"

Now showing items 1-3 of 3

    • Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions 

      Larsson, Thomas; Källberg, Linus (The Eurographics Association and Blackwell Publishing Ltd., 2013)
      In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension. This operation is important in, for example, classification, clustering, ...

    • Sparse Iterative Closest Point 

      Bouaziz, Sofien; Tagliasacchi, Andrea; Pauly, Mark (The Eurographics Association and Blackwell Publishing Ltd., 2013)
      Rigid registration of two geometric data sets is essential in many applications, including robot navigation, surface reconstruction, and shape matching. Most commonly, variants of the Iterative Closest Point (ICP) algorithm ...

    • Watertight Scenes from Urban LiDAR and Planar Surfaces 

      Kreveld, Marc van; Lankveld, Thijs van; Veltkamp, Remco C. (The Eurographics Association and Blackwell Publishing Ltd., 2013)
      The demand for large geometric models is increasing, especially of urban environments. This has resulted in production of massive point cloud data from images or LiDAR. Visualization and further processing generally require ...