Description
The description of the project can bef found at -http://mypages.iit.edu/~xzhang22/GISCUP2014/index.php
http://mypages.iit.edu/~xzhang22/GISCUP2014/problem.php
The program should implement any algorithm. It may not be the best , but the PROGRAM CODE SHOULD SHOW THAT I ATLEAST WORKED ON THE ALGORITHM and tried to reduce the vertices/or whatever in the algorithm.
the initial algorithm design and cost analysis
of the CUP project should be given. (ANY LANGUAGE IS OKAY, OS-WINDOWS)
INPUT: A set of linear geometries that bound polygonal regions and a set of constraining points.
OBJECTIVE: Simplify the linear geometries such that the relationship between the constraining points and linear geometries before and after the simplification does not change. In addition, the topological relationships between the original set of input linear geometries does not change after the simplification.
Description: Geometry generalization is a well known area and there are two main algorithms ((i) Peucker Algorithm and (ii) Visvalingam_Whyatt Algorithm). These techniques can be applied to linear and polygonal geometries to produce generalized geometries. The same techniques can also be applied to produce generalized maps. In map generalization one of the difficult problems is to maintain the topological consistency between adjacent polygonal regions during the simplification process. This is explained with the help of the following figures..
DETAILS CAN BE FOUND IN THE LINK
PRICE-NEGOTIABLE
yours rkreddy...!! contact