Simultaneous curve simplification

Journal of Geographical Systems

Volumn 11, Issue 3, 2009, Pages 273-289

  Dyken, Christopher ^a   Dæhlen, Morten ^b   Sevaldrud, Thomas ^c  

^a SINTEF ICT   (Norway)

^b UNIVERSITY OF OSLO   (Norway)

^c World Beside AS   (Norway)

Author keywords

Digital line graph; Multi resolution; Simplification; Triangulation

Indexed keywords

CARTOGRAPHY; CONTOUR MAP; CURVATURE; DIGITAL MAPPING; GRAPHICAL METHOD; LINEARITY; ROAD; TOPOLOGY; TRIANGULATION;

EID: 68949143239     PISSN: 14355930     EISSN: 14355949     Source Type: Journal    
DOI: 10.1007/s10109-009-0078-8     Document Type: Article

References (9)

1. Arge E, Dæhlen M (1997) Data reduction of piecewise linear curves. In: Tveito A, Dæhlen M (eds) Numerical methods and software tools in industrial mathematics, Birkhauser, Boston, pp 347-364
2. Chew L (1987) Constrained delaunay triangulations. In: SCG'87: Proceedings of the third annual symposium on Computational geometry, ACM, New York, pp 215-222
3. Douglas D, Peucker T (1973) Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Can Cartogr 10(2):112-122
4. Heckbert P, Garland M (1997) Survey on polygonal surface simplification algorithms. Technical report, Carnegie Mellon University, Multiresolution Surface Modeling Course, SIGGRAPH-97
5. Hjelle Ø, Dæhlen M (2006) Triangulations and applications. Springer, Berlin
6. Lee D, Lin A (1986) Generalized delaunay triangulation for planar graphs. Discret Comput Geom 1:201-217
7. Nielson G (1997) Tools for triangulations and tetrahedrizations and constructing functions defined over them. CS Press, Washington, pp 429-525
8. Ramer U (1972) An iterative procedure for the polygonal approximation of plane curves. Comput Graphics Image Process 1:244-256
9. US Geological Survey (1997) Lake Tahoe data clearinghouse website. http://tahoe.usgs.gov