License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09111.3
URN: urn:nbn:de:0030-drops-20311
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2031/
Go to the corresponding Portal

Giesen, Joachim ; Madhusudan, Manjunath

Minimizing Absolute Gaussian Curvature Locally

pdf-format:
09111.GiesenJoachim.Paper.2031.pdf (0.4 MB)

Abstract

One of the remaining challenges when reconstructing a surface from a
finite sample is recovering non-smooth surface features like sharp
edges. There is practical evidence showing that a two step approach
could be an aid to this problem, namely, first computing a
polyhedral reconstruction isotopic to the sampled surface, and
secondly minimizing the absolute Gaussian curvature of this
reconstruction globally. The first step ensures topological
correctness and the second step improves the geometric accuracy of
the reconstruction in the presence of sharp features without
changing its topology. Unfortunately it is computationally hard to
minimize the absolute Gaussian curvature globally. Hence we study a
local variant of absolute Gaussian curvature minimization problem
which is still meaningful in the context of surface
fairing. Absolute Gaussian curvature like Gaussian curvature is
concentrated at the vertices of a polyhedral surface embedded into
$mathbb{R}^3$. Local optimization tries to move a single vertex in
space such that the absolute Gaussian curvature at this vertex is
minimized. We show that in general it is algebraically hard to find
the optimal position of a vertex. By algebraically hard we mean that
in general an optimal solution is not constructible, i.e., there
exist no finite sequence of expressions starting with rational numbers,
where each expression is either the sum, difference,
product, quotient or $k$'th root of preceding expressions and the
last expressions give the coordinates of an optimal solution. Hence
the only option left is to approximate the optimal position. We
provide an approximation scheme for the minimum possible value of
the absolute Gaussian curvature at a vertex.

BibTeX - Entry

@InProceedings{giesen_et_al:DagSemProc.09111.3,
  author =	{Giesen, Joachim and Madhusudan, Manjunath},
  title =	{{Minimizing Absolute Gaussian Curvature Locally}},
  booktitle =	{Computational Geometry},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9111},
  editor =	{Pankaj Kumar Agarwal and Helmut Alt and Monique Teillaud},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2009/2031},
  URN =		{urn:nbn:de:0030-drops-20311},
  doi =		{10.4230/DagSemProc.09111.3},
  annote =	{Keywords: Absolute Gaussian curvature, surface reconstruction, mesh smoothing}
}

Keywords: Absolute Gaussian curvature, surface reconstruction, mesh smoothing
Collection: 09111 - Computational Geometry
Issue Date: 2009
Date of publication: 23.06.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI