Loading...

TIN Simplification in MapReduce

Taheri Otaghsara, Mohammad | 2018

1175 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 50574 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Ghodsi, Mohammad
  7. Abstract:
  8. TIN (Triangulated Irregular Network) is a Data Structure for storing and manipulating surfaces like maps in GIS applications or 3D models in game engines or Vector Fields . A TIN contains a set of triangulated vertices (which has irregular distribution) and each vertex shows a point in space . We trying to find the smallest possible set (optimal solution) of vertices from input surface (which given as a TIN) to approximate input surface with epsilon error which is given as input. also, surface simplification problem is a member of NP-Hard class. The hardness of problem makes it infeasible to find an optimal solution in polynomial time. So we try finding an approximate algorithm for this problem. In recent years, the quality and amount of this kind of data increased and makes it hard to store or process so we need to simplify data with a proper amount of error to make it easier for processing or storing. So we can use distributed processing systems for simplification. MapReduce is a programming model and an associated implementation for processing and generating large data sets with a parallel, distributed algorithm on a cluster. MRC class is a theoretical model for MapReduce which try to make it more practical with adding some restrictions on the number of machines and memory of each machine in our cluster and amount of data transmission between our machines in each MapReduce round. We are trying to design an approximate algorithm for TIN simplification in MRC class
  9. Keywords:
  10. Computational Geometry ; Simplification ; Triangulated Irregular Network Terrian (TIN) ; Map Reduce Processing

 Digital Object List

 Bookmark

...see more