A computational approach to the cartographic dot distribution problem

Cardinal Scholar

Show simple item record

dc.contributor.advisor McGrew, J. Michael en_US
dc.contributor.author Hickey, Mutahar en_US
dc.date.accessioned 2011-06-03T19:36:25Z
dc.date.available 2011-06-03T19:36:25Z
dc.date.created 1993 en_US
dc.date.issued 1993
dc.identifier LD2489.Z78 1993 .H53 en_US
dc.identifier.uri http://cardinalscholar.bsu.edu/handle/handle/184741
dc.description.abstract In the field of cartography, there is occasionally a need to create a distribution of dots on a map. These dots should give an impression of the density of some countable object set. This type of map is called a "Dot Distribution Map".Up to the current time, if the dots are to represent reality at all, they have to be placed by hand by a cartographer using a digitizing tablet or other input device. This is due to the fact that a census of a region gives only a total, yet it is known that the densities vary within that region. A cartographer can look at all the data available about a region and then can make judgements about how the densities will change within the region. He then can place dots which represent his interpretation of reality.This thesis states that there exists an algorithm which would assign dots to a map based upon the common belief that the density will gradate smoothly from one region with one census value to another region with a different census value.The approach taken was to relate the Map regions to polygons and to then subdivide the polygons into triangles. These triangles would then be subdivided into six children recursively and the data stored in a hex-tree. This is the current level of development. the next steps will be:Generate a surface above the 2-D map based upon the known input data of counts for the various regions.From the centroid for each existing leaf on the Hex-Tree, find the corresponding Zi value from the surface information. From each of these leaves, recursively subdivide the triangle further until the number of dots indicated by the Zt. value can be placed on the map.
dc.description.sponsorship Department of Computer Science
dc.format.extent vii, 69 leaves : ill. (some col.), col. maps ; 28 cm. en_US
dc.source Virtual Press en_US
dc.subject.lcsh Cartography -- Data processing. en_US
dc.subject.lcsh Cartography -- Computer programs. en_US
dc.title A computational approach to the cartographic dot distribution problem en_US
dc.description.degree Thesis (M.S.)
dc.identifier.cardcat-url http://liblink.bsu.edu/catkey/865937 en_US


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

  • Master's Theses [5510]
    Master's theses submitted to the Graduate School by Ball State University master's degree candidates in partial fulfillment of degree requirements.

Show simple item record

Search Cardinal Scholar


Browse

My Account