Deconstruction of teragons into decogons

Computers and Graphics (Pergamon)

Volumn 23, Issue 1, 1999, Pages 155-167

  Visvalingam, M ^a   Brown, C I ^a  

^a UNIVERSITY OF HULL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FRACTALS; PATTERN RECOGNITION;

DECOGONS; DECONSTRUCTION; TERAGONS;

COMPUTATIONAL GEOMETRY;

EID: 0033077620     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8493(98)00123-X     Document Type: Article

References (25)

1. Visvalingam M. Approximation, Generalisation and Deconstruction of Planar Curves. Unpublished Cartographic Information Systems Research Group Discussion Paper 14, University of Hull, 1996:13pp.
2. Jenks GF. Geographic logic in line generalisation. Cartographica 1989;26(1):27-42.
3. Visvalingam M, Whyatt JD. The Douglas-Peucker algorithm for line simplification: Re-evaluation through visualisation. Computer Graphics Forum 1990:9(3):213-28.
4. Robinson AH, Morrison JL, Kimerling AJ, Guptill SC. Elements of Cartography, 6th Ed. New York: Wiley, 1995.
5. Thapa K. Detection of Critical Points: The First Step to Automatic Line Generalisation. Report 379, Department of Geodetic Science and Surveying, Ohio State University, Columbus, OH, 43210-1247, 1987:178pp.
6. Pikaz A, Dinstein I. An algorithm for polygonal approximation based on iterative point elimination. Pattern Recognition Letters 1995;16:557-63.
7. Ramer U. An iterative procedure for polygonal approximation of plane closed curves. Computer Graphics and Image Processing 1972;1:244-56.
8. Douglas DH, Peucker TK. Algorithms for the reduction of the number of points required to represent a digitised line or its caricature. The Canadian Cartographer 1973;10(2): 112-22.
9. Visvalingam M, Whyatt JD. Line generalisation by repeated elimination of points. Cartographic Journal 1993;30(1): 46-51.
10. Whyatt JD. Visualisation and Re-Evaluation of Line Simplification Algorithms. Unpublished PhD Thesis, University of Hull, 1991:259pp.
11. Whyatt JD, Wade PR. The Douglas-Peucker line simplification algorithm. Bulletin of the Society of University Cartographers 1988;22(1):17-25.
12. Visvalingam M, Whyatt JD. Cartographic algorithms: Problems of implementation and evaluation and the impact of digitising errors. Computer Graphics Forum 1991;10(3):225-35.
13. McMaster RB. Automated line generalisation. Cartographica 1987;24(2):74-111.
14. Visvalingam M, Williamson PJ. Simplification and generalisation of large scale data for roads: A comparison of two filtering algorithms. Cartography and Geographic Information Systems 1995;22(4):264-75.
15. Visvalingam M, Dowson K. Algorithms for sketching surfaces. International Computers & Graphics 1998;22(2/3): 269-280.
16. Ballard DH. Strip trees: A hierarchical representation for curves. Communications of Association for Computing Machinery 1981;24(5):310-21.
17. Jones CB, Abraham IM. Line generalisation in a global cartographic database. Cartographica 1987;24(3):32-45.
18. Buttenfield BP. Digital definitions of scale dependent line structure. In: Blakemore: M, editor. Proceedings of Auto Carto London. International Cartographic Association, London, 1986:497-506.
19. Mandelbrot BM. The Fractal Geometry of Nature, 3rd Edn. New York, W.H. Freeman, 1983.
20. Senechal M. Symmetry revisited. In: Hargittai I, editor. Symmetry: Unifying Human Understanding. Oxford: Pergamon Press, 1989;1-12.
21. Mussigmann. Texture analysis using fractal dimensions. In: Encarnacao JL, Peitgen J-O, Sakas G, Englert G, editors. Fractal Geometry and Computer Graphics. Berlin: Springer, 1992:217-230.
22. Kaye BH. Chaos and Complexity. Weinheim: VCH, 1993.
23. Kirby GH. Visvalingam M, Wade P. The recognition and representation of polygons with holes. The Computer Journal 1979;37(1):3-15.
24. Maling DH. Measurements from Maps: Principles and Methods of Cartometry. Oxford: Pergamon Press, 1989.
25. Prusinkiewicz P, Lindenmayer A. The Algorithmic Beauty of Plants. New York: Springer, 1990.