Line simplification with restricted orientations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1663, Issue , 1999, Pages 13-24

  Neyer, Gabriele ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DYNAMIC PROGRAMMING;

ADJACENT VERTICES; LINE SEGMENT; LINE SIMPLIFICATION; ORDERED SET; POLYGONAL CHAINS;

C (PROGRAMMING LANGUAGE);

EID: 84948953854     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48447-7_2     Document Type: Conference Paper

References (10)

1. [AG93] Alt, H., Godau, M.: Computing the Fréchet Distance Between Two Polygonal curves. International Journal of Computational Geometry Applications 5 (1995) 75-91
2. [AG96] Alt, H., Guibas, L. J.: Discrete Geometric Shapes: Matching, Interpolation, and Approximation a Survey. Research paper B 96-11, Institute of Computer Science, Freie Universität Berlin (1996)
3. [AOS94] Adegeest, J., Overmars, M., Snoeyink, J. S.: Minimum Link C-oriented Paths: Single-Source Queries. International Journal of Computational Geometry & Applications 4 (1) (1994) 39-51
4. [DP73] Douglas, D. H., Peucker, T. K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Geographer 10 (2) (1973) 112-122
5. [GHMS93] Guibas, L. J., Hershberger, J. E., Mitchell, J. S. B., Snoeyink, J. S.: Approximating Polygons and Subdivisions with Minimum Link Paths. International Journal of Computational Geometry &, Applications 3 (4) (1993) 383-415
6. [God91] Godau, M.: Die Fréchet-Metrik für Polygonzüge-Algorithmen zur Ab-standsmessung und Approximation. Diplomarbeit, Institute of Computer Science, Freie Universität Berlin (1991)
7. [God98] Godau, M.: Personal communication (1998)
8. [HS92] Hershberger, J., Snoeyink, J. S.: Speeding Up the Douglas-Peucker Line-Simplification Algorithm. Technical Report TR-92-07, Department of Computer Science, University of British Columbia, April (1992)
9. [Ney98] Neyer, G.: Line Simplification with Restricted Orientations. Technical Report TR 311, http://www.inf.ethz.ch/publications/tech-reports/index.html, Department of Computer Science, ETH Zurich, Switzerland, (1998)
10. [Wei97] Weibel, R.: Generalization of Spatial Data: Principles and Selected Algorithms. Lecture Notes in Computer Science, 1340, 99-152, (1997)