Convex decomposition of polyhedra for AVAL
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
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
IdentifiersURN: urn:nbn:se:umu:diva-32348OAI: oai:DiVA.org:umu-32348DiVA: diva2:302904