Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Make it Simpler: Structure-aware mesh decimation of large scale models
Linköping University, Department of Electrical Engineering, Information Coding.
2019 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesisAlternative title
Gör det enklare : Strukturmedveten meshdecimering av storskaliga modeller (Swedish)
Abstract [en]

A 3D-model consists out of triangles, and in many cases, the amount of triangles are unnecessarily large for the application of the model. If the camera is far away from a model, why should all triangles be there when in reality it would make sense to only show the contour of the model? Mesh decimation is often used to solve this problem, and its goal is to minimize the amount of triangles while still keep the visual representation intact. Having the decimation algorithm being structure aware, i.e. having the algorithm aware of where the important parts of the model are, such as corners, is of great benefit when doing extreme simplification. The algorithm can then decimate large, almost planar parts, to only a few triangles while keeping the important features detailed. This thesis aims to describe the development of a structure aware decimation algorithm for the company Spotscale, a company specialized in creating 3D-models of drone footage.

Place, publisher, year, edition, pages
2019. , p. 38
Keywords [en]
mesh decimation, structure-aware
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:liu:diva-157178ISRN: LiTH-ISY-EX--19/5192--SEOAI: oai:DiVA.org:liu-157178DiVA, id: diva2:1320121
External cooperation
Spotscale AB
Subject / course
Computer Engineering
Presentation
2019-03-15, Algoritmen, Linköping, 15:15 (Swedish)
Supervisors
Examiners
Available from: 2019-06-17 Created: 2019-06-04 Last updated: 2019-06-17Bibliographically approved

Open Access in DiVA

fulltext(8484 kB)30 downloads
File information
File name FULLTEXT01.pdfFile size 8484 kBChecksum SHA-512
266f468ad97bfda2d9b84f6426036d703b71f60bbae8441a2737af387c4ca9dab0398a46570a6d061fb1f3936366718c54793d25ea6de09f2625e614ffa34bdf
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Böök, Daniel
By organisation
Information Coding
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 30 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 94 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf