Bisectors, Buffers, and Base Maps
dc.contributor.author | Arlinghaus, Sandra Lach | |
dc.date.accessioned | 2008-05-06T01:13:08Z | |
dc.date.available | 2008-05-06T01:13:08Z | |
dc.date.issued | 2001-12-21 | |
dc.identifier.citation | Arlinghaus, Sandra L. "Bisectors, Buffers, and Base Maps." Solstice: An Electronic Journal of Geography and Mathematics, Volume XII, Number 2. Ann Arbor: Institute of Mathematical Geography, 2001. Persistent URL (URI): http://hdl.handle.net/2027.42/58352 | en_US |
dc.identifier.issn | 1059-5325 | |
dc.identifier.uri | https://hdl.handle.net/2027.42/58352 | |
dc.description | Once the file is unzipped, launch index.html in an internet browser window. | en_US |
dc.description.abstract | In 1911, Thiessen and Alter [21] wrote on the analysis of rainfall using polygons surrounding rain gauges. Given a scatter of rain gauges, represented abstractly as dots, partition the underlying plane into polygons containing the dots in such a way that all points within any given polygon are closer to the rain gauge dot within that polygon than they are to any other gauge-dot. The geometric construction usually associated with performing this partition of the plane into a mutually exclusive, yet exhaustive, set of polygons is performed by joining the gauge-dots with line segments, finding the perpendicular bisectors of those segments, and extracting a set of polygons with sides formed by perpendicular bisectors. It is this latter set of polygons that has come to be referred to as "Thiessen polygons" (and earlier names such as Dirichlet region or Voronoi polygon, see Coxeter [4]). The construction using bisectors is tedious and difficult to execute with precision when performed by hand. Kopec (1963) [11] noted that an equivalent construction results when circles of radius the distance between adjacent points are used. Indeed, that construction is but one case of a general construction of Euclid. Like Kopec, Rhynsburger (1973) [20] also sought easier ways to construct Thiessen polygons: Kopec through knowledgeable use of geometry and Rhynsburger through the development of computer algorithms. The world of the Geographical Information System (GIS) software affords an opportunity to combine both. | en_US |
dc.format.extent | 169857 bytes | |
dc.format.mimetype | application/zip | |
dc.language.iso | en_US | en_US |
dc.publisher | Institute of Mathematical Geography | en_US |
dc.relation.ispartofseries | Solstice, Volume XII, Number 2 | en_US |
dc.subject | Bisectors | en_US |
dc.subject | Buffers | en_US |
dc.title | Bisectors, Buffers, and Base Maps | en_US |
dc.type | Animation | en_US |
dc.type | Article | en_US |
dc.type | Image | en_US |
dc.subject.hlbsecondlevel | Geography and Maps | |
dc.subject.hlbtoplevel | Social Sciences | |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Adjunct Professor of Mathematical Geography and Population-Environment Dynamics, School of Natural Resources and Environment | en_US |
dc.contributor.affiliationother | Community Systems Foundation | en_US |
dc.contributor.affiliationother | Arlinghaus Enterprises | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/58352/1/sarhaus.zip | |
dc.owningcollname | Mathematical Geography, Institute of (IMaGe) |
Files in this item
-
Interdisciplinary and Peer-Reviewed
-
Mathematical Geography, Institute of (IMaGe)
Publications and Scholarly Research Projects.
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.