Discrete differential error metric for surface simplification

Sun Jeong Kim, Soo Kyun Kim, Chang-Hun Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

34 Citations (Scopus)

Abstract

In this paper we propose a new discrete differential error metric for surface simplification. Many surface simplification algorithms have been developed in order to produce rapidly high quality approximations of polygonal models, and the quadric error metric based on the distance error is the most popular and successful error metric so far Even though such distance based error metrics give visually pleasing results with a reasonably fast speed, it is hard to measure an accurate geometric error on a highly curved and thin region since the error measured by the distance metric on such a region is usually small and causes a loss of visually important features. To overcome such a drawback, we define a new error metric based on the theory of local differential geometry in such a way that the first and the second order discrete differentials approximated locally on a discrete polygonal surface are integrated into the usual distance error metric. The benefits of our error metric are preservation of sharp feature regions after a drastic simplification, small geometric errors, and fast computation comparable to the existing methods.

Original languageEnglish
Title of host publicationProceedings - Pacific Conference on Computer Graphics and Applications
PublisherIEEE Computer Society
Pages276-283
Number of pages8
Volume2002-January
ISBN (Print)0769517846
DOIs
Publication statusPublished - 2002
Event10th Pacific Conference on Computer Graphics and Applications, PG 2002 - Beijing, China
Duration: 2002 Oct 92002 Oct 11

Other

Other10th Pacific Conference on Computer Graphics and Applications, PG 2002
CountryChina
CityBeijing
Period02/10/902/10/11

Fingerprint

Simplification
Metric
Distance Metric
Quadric
Differential Geometry
Preservation
Geometry
Approximation

Keywords

  • Computer errors
  • Computer science
  • Geometry
  • Graphics
  • Hardware
  • Loss measurement
  • Piecewise linear approximation
  • Shape
  • Solid modeling
  • Velocity measurement

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Modelling and Simulation

Cite this

Kim, S. J., Kim, S. K., & Kim, C-H. (2002). Discrete differential error metric for surface simplification. In Proceedings - Pacific Conference on Computer Graphics and Applications (Vol. 2002-January, pp. 276-283). [1167871] IEEE Computer Society. https://doi.org/10.1109/PCCGA.2002.1167871

Discrete differential error metric for surface simplification. / Kim, Sun Jeong; Kim, Soo Kyun; Kim, Chang-Hun.

Proceedings - Pacific Conference on Computer Graphics and Applications. Vol. 2002-January IEEE Computer Society, 2002. p. 276-283 1167871.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, SJ, Kim, SK & Kim, C-H 2002, Discrete differential error metric for surface simplification. in Proceedings - Pacific Conference on Computer Graphics and Applications. vol. 2002-January, 1167871, IEEE Computer Society, pp. 276-283, 10th Pacific Conference on Computer Graphics and Applications, PG 2002, Beijing, China, 02/10/9. https://doi.org/10.1109/PCCGA.2002.1167871
Kim SJ, Kim SK, Kim C-H. Discrete differential error metric for surface simplification. In Proceedings - Pacific Conference on Computer Graphics and Applications. Vol. 2002-January. IEEE Computer Society. 2002. p. 276-283. 1167871 https://doi.org/10.1109/PCCGA.2002.1167871
Kim, Sun Jeong ; Kim, Soo Kyun ; Kim, Chang-Hun. / Discrete differential error metric for surface simplification. Proceedings - Pacific Conference on Computer Graphics and Applications. Vol. 2002-January IEEE Computer Society, 2002. pp. 276-283
@inproceedings{c85da3b6c9d9489bb34ffb351ae9e268,
title = "Discrete differential error metric for surface simplification",
abstract = "In this paper we propose a new discrete differential error metric for surface simplification. Many surface simplification algorithms have been developed in order to produce rapidly high quality approximations of polygonal models, and the quadric error metric based on the distance error is the most popular and successful error metric so far Even though such distance based error metrics give visually pleasing results with a reasonably fast speed, it is hard to measure an accurate geometric error on a highly curved and thin region since the error measured by the distance metric on such a region is usually small and causes a loss of visually important features. To overcome such a drawback, we define a new error metric based on the theory of local differential geometry in such a way that the first and the second order discrete differentials approximated locally on a discrete polygonal surface are integrated into the usual distance error metric. The benefits of our error metric are preservation of sharp feature regions after a drastic simplification, small geometric errors, and fast computation comparable to the existing methods.",
keywords = "Computer errors, Computer science, Geometry, Graphics, Hardware, Loss measurement, Piecewise linear approximation, Shape, Solid modeling, Velocity measurement",
author = "Kim, {Sun Jeong} and Kim, {Soo Kyun} and Chang-Hun Kim",
year = "2002",
doi = "10.1109/PCCGA.2002.1167871",
language = "English",
isbn = "0769517846",
volume = "2002-January",
pages = "276--283",
booktitle = "Proceedings - Pacific Conference on Computer Graphics and Applications",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Discrete differential error metric for surface simplification

AU - Kim, Sun Jeong

AU - Kim, Soo Kyun

AU - Kim, Chang-Hun

PY - 2002

Y1 - 2002

N2 - In this paper we propose a new discrete differential error metric for surface simplification. Many surface simplification algorithms have been developed in order to produce rapidly high quality approximations of polygonal models, and the quadric error metric based on the distance error is the most popular and successful error metric so far Even though such distance based error metrics give visually pleasing results with a reasonably fast speed, it is hard to measure an accurate geometric error on a highly curved and thin region since the error measured by the distance metric on such a region is usually small and causes a loss of visually important features. To overcome such a drawback, we define a new error metric based on the theory of local differential geometry in such a way that the first and the second order discrete differentials approximated locally on a discrete polygonal surface are integrated into the usual distance error metric. The benefits of our error metric are preservation of sharp feature regions after a drastic simplification, small geometric errors, and fast computation comparable to the existing methods.

AB - In this paper we propose a new discrete differential error metric for surface simplification. Many surface simplification algorithms have been developed in order to produce rapidly high quality approximations of polygonal models, and the quadric error metric based on the distance error is the most popular and successful error metric so far Even though such distance based error metrics give visually pleasing results with a reasonably fast speed, it is hard to measure an accurate geometric error on a highly curved and thin region since the error measured by the distance metric on such a region is usually small and causes a loss of visually important features. To overcome such a drawback, we define a new error metric based on the theory of local differential geometry in such a way that the first and the second order discrete differentials approximated locally on a discrete polygonal surface are integrated into the usual distance error metric. The benefits of our error metric are preservation of sharp feature regions after a drastic simplification, small geometric errors, and fast computation comparable to the existing methods.

KW - Computer errors

KW - Computer science

KW - Geometry

KW - Graphics

KW - Hardware

KW - Loss measurement

KW - Piecewise linear approximation

KW - Shape

KW - Solid modeling

KW - Velocity measurement

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

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

U2 - 10.1109/PCCGA.2002.1167871

DO - 10.1109/PCCGA.2002.1167871

M3 - Conference contribution

AN - SCOPUS:33750595182

SN - 0769517846

VL - 2002-January

SP - 276

EP - 283

BT - Proceedings - Pacific Conference on Computer Graphics and Applications

PB - IEEE Computer Society

ER -