Show simple item record

dc.contributor.advisorMould, Daviden_US
dc.creatorXu, Lingen_US
dc.date.accessioned2008-05-14T03:35:49Zen_US
dc.date.accessioned2013-01-04T04:30:47Z
dc.date.available2009-05-20T08:00:00Zen_US
dc.date.available2013-01-04T04:30:47Z
dc.date.created2008-05en_US
dc.date.issued2008-05-20en_US
dc.date.submittedMay 2008en_US
dc.identifier.urihttp://hdl.handle.net/10388/etd-05142008-033549en_US
dc.description.abstractDendritic shapes are commonplace in the natural world such as trees, lichens, coral and lightning. Models of dendritic shapes are widely needed in many areas. Because of their branching fractal and erratic structures modeling dendritic shapes is a tricky task. Existing methods for modeling dendritic shapes are slow and complicated.In this thesis we present a procedural algorithm of using path planning to model dendritic shapes. We generate a dendrite by finding the least-cost paths from multiple endpoints to a common generator and use the dendrite to build the geometric model. With the control handles of endpoint placement, fractal shape, edge weights distribution and path width, we create different shapes of dendrites that simulate different kinds of dendritic shapes very well. Compared with some existing methods, our algorithm is fast and simple.en_US
dc.language.isoen_USen_US
dc.subjectprocedural modelingen_US
dc.subjectdendritesen_US
dc.subjectpath planningen_US
dc.subjectnatural phenomenaen_US
dc.titleModeling dendritic shapes - using path planningen_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.grantorUniversity of Saskatchewanen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Science (M.Sc.)en_US
dc.type.materialtexten_US
dc.type.genreThesisen_US
dc.contributor.committeeMemberTanaka, Kaorien_US
dc.contributor.committeeMemberOsgood, Nathanielen_US
dc.contributor.committeeMemberNeufeld, Ericen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record