liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Polygonal models from range scanned trees
Linköping University, Department of Science and Technology, Visual Information Technology and Applications (VITA).
2009 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

3D Models of botanical trees are very important in video games, simulation, virtual reality, digital city modeling and other fields of computer graphics. However, since the early days of computer graphics, the modeling of trees has been challenging, because of the huge dynamical range between its smallest and largest structures and their geometrical complexity. Trees are also ubiquitous which makes it even hard to model them in a realistic way, Current techniques are limited in that they model a tree either in a rule-based way or in an approximated way. These methods emphasize appearance while sacrificing its real structure. Recent development in range scanners are making 3D aquisition feasible for large and complex objects. This report presents the semi-automatic technique developed for modeling laser-scanned trees. First, the user draws a few strokes on the depth image plane generated from the dataset. Branches are then extracted through the 2D Curve detection algorithm originally developed. Afterwards, those short branches are connected together to generate the skeleton of the tree by forming a Minimum Spanning Tree (MST). Finally, the geometry of the tree skeleton is produced using allometric rules for branch thickness and branching angles.

Place, publisher, year, edition, pages
2009. , 37 p.
Keyword [en]
computer graphics, image reconstruction, polygonal models
National Category
Computer Vision and Robotics (Autonomous Systems)
Identifiers
URN: urn:nbn:se:liu:diva-50704ISRN: LIU-ITN-TEK-A--09/027--SEOAI: oai:DiVA.org:liu-50704DiVA: diva2:271952
Presentation
TP32, entréplan, Täppan, ITN, Linköping University, Campus Norrköping, 60174 Norrköping (English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2009-10-29 Created: 2009-10-13 Last updated: 2009-10-29Bibliographically approved

Open Access in DiVA

fulltext(1553 kB)621 downloads
File information
File name FULLTEXT01.pdfFile size 1553 kBChecksum SHA-512
1c0eb9a9af2e633ee53fedc66dd92a21ef0ff03bc596ec9b3e183e63a21de936439f8a420223d4fdf8191c99f402a5eb3cb73b229eaaac83df58c514e47a8da6
Type fulltextMimetype application/pdf

By organisation
Visual Information Technology and Applications (VITA)
Computer Vision and Robotics (Autonomous Systems)

Search outside of DiVA

GoogleGoogle Scholar
Total: 621 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: 324 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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