Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1957/2824
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor | Mortensen, Eric | - |
dc.contributor | Reitsma, Rene | - |
dc.contributor | Zhang, Eugene | - |
dc.date | 2006-08-02T21:44:37Z | - |
dc.date | 2006-08-02T21:44:37Z | - |
dc.date | 2006-06-14 | - |
dc.date | 2006-08-02T21:44:37Z | - |
dc.date.accessioned | 2013-10-16T07:39:06Z | - |
dc.date.available | 2013-10-16T07:39:06Z | - |
dc.date.issued | 2013-10-16 | - |
dc.identifier | http://hdl.handle.net/1957/2824 | - |
dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1957/2824 | - |
dc.description | Graduation date: 2007 | - |
dc.description | Traditional application of Voronoi diagrams for space partitioning creates Voronoi regions, with areas determined by the generators’ relative locations and weights. Especially in the area of information space (re)construction, however, there is a need for inverse solutions; i.e., finding weights that result in regions with predefined areas. In this thesis, an Adaptive Multiplicatively Weighted Voronoi Diagram solution is formulated and a raster-based optimization method for finding the associated weight set is proposed. The basic algorithm is described, and several improvements are explored in detail, followed by algorithm’s complexity analysis. The adaptive solution is successfully tested is successfully tested on a series of ideal/pathological cases, as well as using empirical data. | - |
dc.language | en_US | - |
dc.subject | voronoi | - |
dc.subject | information space | - |
dc.subject | amwvd | - |
dc.subject | mwvd | - |
dc.title | Information space mapping with adaptive multiplicatively weighted Voronoi diagrams | - |
dc.type | Thesis | - |
Appears in Collections: | ScholarsArchive@OSU |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.