Applications of Analytical Cartography

Several applications of analytical cartography are presented. They include terrain visibility (including visibility indices, viewsheds, and inter-visibility), map overlay (including solving round-off errors with C++ class libraries and computing polygon areas from incomplete information), mobility, and interpolation and approximation of curves and of terrain (including curves and surfaces in CAD/CAM, smoothing terrains with over-determined systems of equations, and drainage patterns). General themes become apparent, such as simplicity, robustness, and the tradeoff between different data types. Finally several future applications are discussed, such as the lossy compression of correlated layers, and just good enough computation when high precision is not justified.

[1]  Bor-Wen Tsai,et al.  The Effect of DEM Resolution on Slope and Aspect Mapping , 1991 .

[2]  W. Randolph Franklin,et al.  An exact hidden sphere algorithm that operates in linear time , 1981 .

[3]  David M. Mark,et al.  Part 4: Mathematical, Algorithmic and Data Structure Issues: Automated Detection Of Drainage Networks From Digital Elevation Models , 1984 .

[4]  W. Randolph Franklin,et al.  Boolean Combinations of Polygons in Parallel , 1992, ICPP.

[5]  PETER F. FISHER,et al.  Algorithm and Implementation Uncertainty in Viewshed Analysis , 1993, Int. J. Geogr. Inf. Sci..

[6]  Clark Keith Ray,et al.  Representing visibility for siting problems , 1994 .

[7]  W. Randolph Franklin.  Higher isn ’ t Necessarily Better : Visibility Algorithms and Experiments , 1994 .

[8]  Leila De Floriani,et al.  A hierarchical structure for surface approximation , 1984, Comput. Graph..

[9]  Mark Gahegan,et al.  Feature-Based Derivation of Drainage Networks , 1993, Int. J. Geogr. Inf. Sci..

[10]  Wm. Randolph Franklin,et al.  Contours to digital elevation models: grid-based surface reconstruction methods , 1998 .

[11]  M. Goodchild.  Fractals and the accuracy of geographical measures , 1980 .

[12]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[13]  Wm. Randolph Franklin,et al.  Polygon overlay in prolog , 1987 .

[14]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[15]  Chandrasekhar Narayanaswami.  Parallel processing for geometric applications , 1992 .

[16]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[17]  Bettina Speckmann,et al.  Easy triangle strips for TIN terrain models , 2001, CCCG.

[18]  Peter F. Fisher,et al.  Assessing interpolation accuracy in elevation models , 1993, IEEE Computer Graphics and Applications.

[19]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[20]  Nicholas Chrisman,et al.  Cartographic Data Structures , 1975 .

[21]  Mohan S. Kankanhalli,et al.  Calculating the Area of Overlaid Polygons Without Constructing the Overlay , 1994 .

[22]  E. Guerrieri.  A methodology for software transportability , 1990 .

[23]  Howard Veregin,et al.  Error modeling for the map overlay operation , 1989 .

[24]  Geert-Jan Giezeman,et al.  The CGAL Kernel: A Basis for Geometric Computation , 1996, WACG.