Direct Contouring of Implicit Closest Point Surfaces

Auer, Stefan; Westermann, Rüdiger

Direct Contouring of Implicit Closest Point Surfaces

Files

001-004.pdf (1.35 MB)

Date

2013

Authors

Auer, Stefan
Westermann, Rüdiger

Publisher

The Eurographics Association

Abstract

Constructing a (signed) distance field and contouring its zero level set are two important steps in many surface reconstruction methods. While most high-quality distance transforms compute the distance to the surface as well as the closest point on it, the contouring step typically uses only the distance and omits the closest point information. Our novel closest point contouring algorithm (CPC) uses the full closest point field, and, thus, allows improving existing methods for high-quality triangle mesh reconstruction based on implicit function models: Since we select the vertex positions directly from the set of closest points, all triangle vertices are guaranteed to lie exactly on the zero-contour and no approximations are necessary. By employing recent findings in the context of so-called embedding techniques, we derive a formulation of the mean curvature vector on the closest point representation and use this formulation to properly select the vertices to be triangulated. In combination with a new table-based triangulation scheme this allows us to detect and preserve sharp features, and to avoid small degenerated triangles in smooth areas. CPC can handle open and non-orientable surfaces, and its data-parallel nature makes it well suited for GPUs.

        @inproceedings{:10.2312/conf/EG2013/short/001-004
,
booktitle = {Eurographics 2013 - Short Papers
},
editor = {M.- A. Otaduy and O. Sorkine
},
title = {{Direct Contouring of Implicit Closest Point Surfaces
}},
author = {Auer, Stefan and 
Westermann, Rüdiger
},
year = {2013
},
publisher = {The Eurographics Association
},
ISSN = {1017-4656
},
ISBN = {},
DOI = {/10.2312/conf/EG2013/short/001-004
}
}