Investigating Path Simplification Problems<br/>

Please enable javascript in your browser.

Investigating Path Simplification Problems

1200 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 42513 (02)
University: Sharif University of Technology
Department: Mathematical Science
Advisor(s): Zarei, Alireza
Abstract:
A basic technique in data reduction is to approximate a collection of data by another collection of smaller size. Then, the resulted data are easier to be processed or maintained. An example of such large scale data is the ordered sequence of n points describing a path or a region boundary. We are given a sequence of points p , p , ..., p , and we consider the 1 2 n problem of approximating these points by a path with k < n line segments which error of this path is not greater than special value. Various criterions are defined to compute the path simplification error.This problem can be used in GIS, Image Processing and Computer Graphics problems. In this thesis, we consider special case of this problem and propose algorithms to compute the approximating path
Keywords:
Simplification ; Computational Geometry ; Line Simplification ; Data Reduction