Subscribe: cs.CG updates on arXiv.org
http://arxiv.org/rss/cs.CG
Added By: Feedage Forager Feedage Grade B rated
Language: English
Tags:
arxiv org  arxiv  deciding pure  high order  methods  new vertex  order  pure dimensional  simplicial complex  surface  surfaces  vertex 
Rate this Feed
Rate this feedRate this feedRate this feedRate this feedRate this feed
Rate this feed 1 starRate this feed 2 starRate this feed 3 starRate this feed 4 starRate this feed 5 star

Comments (0)

Feed Details and Statistics Feed Statistics
Preview: cs.CG updates on arXiv.org

cs.CG updates on arXiv.org



Computer Science -- Computational Geometry (cs.CG) updates on the arXiv.org e-print archive



Published: 2017-11-22T20:30:00-05:00

 



Triangulated Surface Denoising using High Order Regularization with Dynamic Weights. (arXiv:1711.08137v1 [cs.CG])

Recovering high quality surfaces from noisy triangulated surfaces is a fundamental important problem in geometry processing.

Sharp features including edges and corners can not be well preserved in most existing denoising methods except the recent total variation (TV) and $\ell_0$ regularization methods.

However, these two methods have suffered producing staircase artifacts in smooth regions.

In this paper, we first introduce a second order regularization method for restoring a surface normal vector field, and then propose a new vertex updating scheme to recover the desired surface according to the restored surface normal field.

The proposed model can preserve sharp features and simultaneously suppress the staircase effects in smooth regions which overcomes the drawback of the first order models.

In addition, the new vertex updating scheme can prevent ambiguities introduced in existing vertex updating methods.

Numerically, the proposed high order model is solved by the augmented Lagrangian method with a dynamic weighting strategy.

Intensive numerical experiments on a variety of surfaces demonstrate the superiority of our method by visually and quantitatively.




Shellability is NP-complete. (arXiv:1711.08436v1 [math.CO])

We prove that for every $d\geq 2$, deciding if a pure, $d$-dimensional, simplicial complex is shellable is NP-hard, hence NP-complete. This resolves a question raised, e.g., by Danaraj and Klee in 1978. Our reduction also yields that for every $d \ge 2$ and $k \ge 0$, deciding if a pure, $d$-dimensional, simplicial complex is $k$-decomposable is NP-hard. For $d \ge 3$, both problems remain NP-hard when restricted to contractible pure $d$-dimensional complexes.