Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Feature-preserving Mesh Simplification: A Vertex Cover Approach
Ansvarig organisation
2008 (Engelska)Konferensbidrag, Publicerat paper (Refereegranskat) Published
Abstract [en]

In computer graphics image synthesis algorithms like ray tracing, the mesh complexity decreases the performance of these algorithms. Therefore, the need arises to reduce the complexity of these meshes and at the same time preserving the salient features of the shape. Initial selection of vertices for mesh simplification heavily relates with the quality of the simplified meshes. In this paper, we present a greedy approach to select initial vertex contraction pairs to preserve salient features in the simplified meshes. The greedy algorithm exploits the property of meshes where vertices forming small features contain less number of edges. The technique selects vertices connected with large number of edges and makes them potential candidates for contraction according to a given cost function. The purpose is to first simplify those regions which are enriched with number of triangles and preserve small details of the shape constructed with small number of triangles. Our technique preserves very small details in the shape even after considerable simplification as compared to other existing techniques. Initial experiments show promising results with preserved salient features.

Ort, förlag, år, upplaga, sidor
Amsterdam, The Netherlands, 2008.
Nyckelord [en]
Mesh simplification, Feature-preserving, Pair contraction, Level of details, Multiresolution modeling
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:bth-8505Lokalt ID: oai:bth.se:forskinfoB99700765EA195AEC12574A30030BEABOAI: oai:DiVA.org:bth-8505DiVA, id: diva2:836231
Konferens
International Conference on Computer Graphics and Visualization 2008 (CGV 2008)
Tillgänglig från: 2012-09-18 Skapad: 2008-08-12 Senast uppdaterad: 2018-02-02Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Personposter BETA

Grahn, Håkan

Sök vidare i DiVA

Av författaren/redaktören
Grahn, Håkan
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 73 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf