Non-Obtuse Remeshing with Centroidal Voronoi Tessellation

Dong Ming Yan; Peter Wonka

doi:10.1109/TVCG.2015.2505279

Non-Obtuse Remeshing with Centroidal Voronoi Tessellation

Dong Ming Yan, Peter Wonka

Research output: Contribution to journal › Article › peer-review

41 Scopus citations

Abstract

We present a novel remeshing algorithm that avoids triangles with small (acute) angles and those with large (obtuse) angles. Our solution is based on an extension of Centroidal Voronoi Tesselation (CVT). We augment the original CVT formulation with a penalty term that penalizes short Voronoi edges, while the CVT term helps to avoid small angles. Our results show significant improvements in remeshing quality over the state of the art.

Original language	English (US)
Article number	7346512
Pages (from-to)	2136-2144
Number of pages	9
Journal	IEEE Transactions on Visualization and Computer Graphics
Volume	22
Issue number	9
DOIs	https://doi.org/10.1109/TVCG.2015.2505279
State	Published - Sep 1 2016

Keywords

Centroidal voronoi tessellation
Restricted voronoi diagram
non-obtuse remeshing

ASJC Scopus subject areas

Software
Signal Processing
Computer Vision and Pattern Recognition
Computer Graphics and Computer-Aided Design

Access to Document

10.1109/TVCG.2015.2505279

Cite this

@article{3fbfe8889cba449da026393d51d66b40,

title = "Non-Obtuse Remeshing with Centroidal Voronoi Tessellation",

abstract = "We present a novel remeshing algorithm that avoids triangles with small (acute) angles and those with large (obtuse) angles. Our solution is based on an extension of Centroidal Voronoi Tesselation (CVT). We augment the original CVT formulation with a penalty term that penalizes short Voronoi edges, while the CVT term helps to avoid small angles. Our results show significant improvements in remeshing quality over the state of the art.",

keywords = "Centroidal voronoi tessellation, Restricted voronoi diagram, non-obtuse remeshing",

author = "Yan, {Dong Ming} and Peter Wonka",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.",

year = "2016",

month = sep,

day = "1",

doi = "10.1109/TVCG.2015.2505279",

language = "English (US)",

volume = "22",

pages = "2136--2144",

journal = "IEEE Transactions on Visualization and Computer Graphics",

issn = "1077-2626",

publisher = "IEEE Computer Society",

number = "9",

}

TY - JOUR

T1 - Non-Obtuse Remeshing with Centroidal Voronoi Tessellation

AU - Yan, Dong Ming

AU - Wonka, Peter

PY - 2016/9/1

Y1 - 2016/9/1

N2 - We present a novel remeshing algorithm that avoids triangles with small (acute) angles and those with large (obtuse) angles. Our solution is based on an extension of Centroidal Voronoi Tesselation (CVT). We augment the original CVT formulation with a penalty term that penalizes short Voronoi edges, while the CVT term helps to avoid small angles. Our results show significant improvements in remeshing quality over the state of the art.

AB - We present a novel remeshing algorithm that avoids triangles with small (acute) angles and those with large (obtuse) angles. Our solution is based on an extension of Centroidal Voronoi Tesselation (CVT). We augment the original CVT formulation with a penalty term that penalizes short Voronoi edges, while the CVT term helps to avoid small angles. Our results show significant improvements in remeshing quality over the state of the art.

KW - Centroidal voronoi tessellation

KW - Restricted voronoi diagram

KW - non-obtuse remeshing

UR - http://www.scopus.com/inward/record.url?scp=84982732273&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84982732273&partnerID=8YFLogxK

U2 - 10.1109/TVCG.2015.2505279

DO - 10.1109/TVCG.2015.2505279

M3 - Article

AN - SCOPUS:84982732273

SN - 1077-2626

VL - 22

SP - 2136

EP - 2144

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

IS - 9

M1 - 7346512

ER -

Non-Obtuse Remeshing with Centroidal Voronoi Tessellation

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this