Change search
ReferencesLink to record
Permanent link

Direct link
Convex decomposition of polyhedra for AVAL
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2010 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In order to perform vulnerability and lethality simulations of vehicles it is necessary to describe their geometry in terms suitable for simulation. AVAL is a piece of software used for such simulations, and a main requirement for input geometry is convexity. Manual decomposition is highly time consuming, and in this thesis, a complete algorithm to perform an automatic convex decomposition is presented and described in more detail than previously done. A proof of concept implementation of the algorithm has been made and tested, and example decompositions are shown. The algorithm is based strongly on earlier work in the eld by Bajaj and Dey, but contains solutions to previously undescribed subproblems. As a result the feasibility of using automatic convex decomposition of vehicle-type geometry as a pre-processing aid is shown.

Place, publisher, year, edition, pages
, UMNAD, 825
National Category
Computer Science
URN: urn:nbn:se:umu:diva-32348OAI: diva2:302904

Available from: 2010-03-11 Created: 2010-03-10 Last updated: 2010-03-11Bibliographically approved

Open Access in DiVA

fulltext(587 kB)204 downloads
File information
File name FULLTEXT01.pdfFile size 587 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 204 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

Total: 115 hits
ReferencesLink to record
Permanent link

Direct link