Proceedings: GI 2007

Surface distance maps

Avneesh Sud , Naga Govindaraju , Russell Gayle , Erik Andersen , Dinesh Manocha

Proceedings of Graphics Interface 2007: Montréal, Québec, Canada, 28 - 30 May 2007, 35-42

DOI 10.20380/GI2007.06

  • Bibtex

    @inproceedings{Sud:2007:10.20380/GI2007.06,
    author = {Sud, Avneesh and Govindaraju, Naga and Gayle, Russell and Andersen, Erik and Manocha, Dinesh},
    title = {Surface distance maps},
    booktitle = {Proceedings of Graphics Interface 2007},
    series = {GI 2007},
    year = {2007},
    issn = {0713-5424},
    isbn = {978-1-56881-337-0},
    location = {Montr{\'e}al, Qu{\'e}bec, Canada},
    pages = {35--42},
    numpages = {8},
    doi = {10.20380/GI2007.06},
    acmdoi = {doi>10.1145/1268517.1268525},
    publisher = {Canadian Human-Computer Communications Society},
    address = {University of Waterloo, Waterloo, Ontario, Canada},
    }

Abstract

We present a new parameterized representation called surface distance maps for distance computations on piecewise 2-manifold primitives. Given a set of orientable 2-manifold primitives, the surface distance map represents the (non-zero) signed distance-to-closest-primitive mapping at each point on a 2-manifold. The distance mapping is computed from each primitive to the set of remaining primitives. We present an interactive algorithm for computing the surface distance map of triangulated meshes using graphics hardware. We precompute a surface parameterization and use the it to define an affine transformation for each mesh primitive. Our algorithm efficiently computes the distance field by applying this affine transformation to the distance functions of the primitives and evaluating these functions using texture mapping hardware. In practice, our algorithm can compute very high resolution surface distance maps at interactive rates and provides tight error bounds on their accuracy. We use surface distance maps for path planning and proximity query computation among complex models in dynamic environments. Our approach can perform planning and proximity queries in a dynamic environment with hundreds of objects at interactive rates and offer significant speedups over prior algorithms.