<--- Back to Details
First PageDocument Content
Geometry / Tessellation / Cartography / Polygons / Cartographic generalization / Communication design / Graphic design / Generalization / Hexagon / RamerDouglasPeucker algorithm / Voronoi diagram / Topological map
Date: 2010-10-10 15:32:05
Geometry
Tessellation
Cartography
Polygons
Cartographic generalization
Communication design
Graphic design
Generalization
Hexagon
RamerDouglasPeucker algorithm
Voronoi diagram
Topological map

PIECE BY PIECE: A METHOD OF CARTOGRAPHIC LINE GENERALIZATION USING REGULAR HEXAGONAL TESSELLATION P. Raposo Department of Geography, The Pennsylvania State University. University Park, Pennsylvania

Add to Reading List

Source URL: pauloraposo.weebly.com

Download Document from Source Website

File Size: 224,70 KB

Share Document on Facebook

Similar Documents

Hillshade from Kenai Peninsula Borough GIS division. Wetland mapping polygons from Kenai Watershed Forum. Wetland functional assessment by Homer Soil & Water Conservation District (HSWCD), 2014. Map prepared by Karyn Noy

Hillshade from Kenai Peninsula Borough GIS division. Wetland mapping polygons from Kenai Watershed Forum. Wetland functional assessment by Homer Soil & Water Conservation District (HSWCD), 2014. Map prepared by Karyn Noy

DocID: 1vqFm - View Document

Hillshade from Kenai Peninsula Borough GIS division. Wetland mapping polygons from Kenai Watershed Forum. Wetland functional assessment by Homer Soil & Water Conservation District (HSWCD), 2014. Map prepared by Karyn Noy

Hillshade from Kenai Peninsula Borough GIS division. Wetland mapping polygons from Kenai Watershed Forum. Wetland functional assessment by Homer Soil & Water Conservation District (HSWCD), 2014. Map prepared by Karyn Noy

DocID: 1vnxa - View Document

Reconstructing Generalized Staircase Polygons with Uniform Step Length Nodari Sitchinava and Darren Strash GD 2017 | Sept. 25, 2017 Department of Computer Science Colgate University

Reconstructing Generalized Staircase Polygons with Uniform Step Length Nodari Sitchinava and Darren Strash GD 2017 | Sept. 25, 2017 Department of Computer Science Colgate University

DocID: 1uGjf - View Document

Experience Report: Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Ilya Sergey University College London, UK

Experience Report: Growing and Shrinking Polygons for Random Testing of Computational Geometry Algorithms Ilya Sergey University College London, UK

DocID: 1uCcz - View Document

Patulous Pegboard Polygons Derek Kisman, Richard Guy & Alex Fink May 9, 2006 A problem in a recent competition was: Given a 2004 by 2004 square grid of dots, what is the largest number of edges of a

Patulous Pegboard Polygons Derek Kisman, Richard Guy & Alex Fink May 9, 2006 A problem in a recent competition was: Given a 2004 by 2004 square grid of dots, what is the largest number of edges of a

DocID: 1uBd3 - View Document