Surface simplification using a discrete curvature norm

Sun Jeong Kim, Chang-Hun Kim, David Levin

Research output: Contribution to journalArticle

60 Citations (Scopus)

Abstract

This paper proposes a mesh simplification algorithm using a discrete curvature norm. Most of the simplification algorithms are using a distance metric to date. The distance metric is very efficient to measure geometric error, but it is difficult to distinguish important shape features such as a high-curvature region even though it has a small distance metric. We suggest a discrete curvature norm to measure geometric error for such features. During simplification the new vertex resulted from an edge collapse takes a position using a butterfly subdivision mask to minimize geometric error. This paper shows that simplification results have smaller geometric errors than previous works, when a discrete curvature norm and a distance metric are together applied to its criterion.

Original languageEnglish
Pages (from-to)657-663
Number of pages7
JournalComputers and Graphics (Pergamon)
Volume26
Issue number5
DOIs
Publication statusPublished - 2002 Oct 1

Fingerprint

Discrete Curvature
Distance Metric
Simplification
Norm
Mesh Simplification
Shape Feature
Subdivision
Mask
Masks
Curvature
Minimise
Vertex of a graph

Keywords

  • Discrete curvatures
  • Edge collapse
  • Level of detail
  • Multiresolution modeling
  • Surface simplification

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Geometry and Topology
  • Modelling and Simulation

Cite this

Surface simplification using a discrete curvature norm. / Kim, Sun Jeong; Kim, Chang-Hun; Levin, David.

In: Computers and Graphics (Pergamon), Vol. 26, No. 5, 01.10.2002, p. 657-663.

Research output: Contribution to journalArticle

Kim, Sun Jeong ; Kim, Chang-Hun ; Levin, David. / Surface simplification using a discrete curvature norm. In: Computers and Graphics (Pergamon). 2002 ; Vol. 26, No. 5. pp. 657-663.
@article{4295c58466dd42548d51872d1bd943b6,
title = "Surface simplification using a discrete curvature norm",
abstract = "This paper proposes a mesh simplification algorithm using a discrete curvature norm. Most of the simplification algorithms are using a distance metric to date. The distance metric is very efficient to measure geometric error, but it is difficult to distinguish important shape features such as a high-curvature region even though it has a small distance metric. We suggest a discrete curvature norm to measure geometric error for such features. During simplification the new vertex resulted from an edge collapse takes a position using a butterfly subdivision mask to minimize geometric error. This paper shows that simplification results have smaller geometric errors than previous works, when a discrete curvature norm and a distance metric are together applied to its criterion.",
keywords = "Discrete curvatures, Edge collapse, Level of detail, Multiresolution modeling, Surface simplification",
author = "Kim, {Sun Jeong} and Chang-Hun Kim and David Levin",
year = "2002",
month = "10",
day = "1",
doi = "10.1016/S0097-8493(02)00121-8",
language = "English",
volume = "26",
pages = "657--663",
journal = "Computers and Graphics",
issn = "0097-8493",
publisher = "Elsevier Limited",
number = "5",

}

TY - JOUR

T1 - Surface simplification using a discrete curvature norm

AU - Kim, Sun Jeong

AU - Kim, Chang-Hun

AU - Levin, David

PY - 2002/10/1

Y1 - 2002/10/1

N2 - This paper proposes a mesh simplification algorithm using a discrete curvature norm. Most of the simplification algorithms are using a distance metric to date. The distance metric is very efficient to measure geometric error, but it is difficult to distinguish important shape features such as a high-curvature region even though it has a small distance metric. We suggest a discrete curvature norm to measure geometric error for such features. During simplification the new vertex resulted from an edge collapse takes a position using a butterfly subdivision mask to minimize geometric error. This paper shows that simplification results have smaller geometric errors than previous works, when a discrete curvature norm and a distance metric are together applied to its criterion.

AB - This paper proposes a mesh simplification algorithm using a discrete curvature norm. Most of the simplification algorithms are using a distance metric to date. The distance metric is very efficient to measure geometric error, but it is difficult to distinguish important shape features such as a high-curvature region even though it has a small distance metric. We suggest a discrete curvature norm to measure geometric error for such features. During simplification the new vertex resulted from an edge collapse takes a position using a butterfly subdivision mask to minimize geometric error. This paper shows that simplification results have smaller geometric errors than previous works, when a discrete curvature norm and a distance metric are together applied to its criterion.

KW - Discrete curvatures

KW - Edge collapse

KW - Level of detail

KW - Multiresolution modeling

KW - Surface simplification

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

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

U2 - 10.1016/S0097-8493(02)00121-8

DO - 10.1016/S0097-8493(02)00121-8

M3 - Article

VL - 26

SP - 657

EP - 663

JO - Computers and Graphics

JF - Computers and Graphics

SN - 0097-8493

IS - 5

ER -