Loading...

Weighted TINs Smplification and Design of Some Algorithms on it

Dabaghi Zarandi, Fahimeh | 2010

481 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 40776 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Ghodsi, Mohammad
  7. Abstract:
  8. Due to increasing quality of satellite images, volume of stored data significantly increased, so speed of statistical and computational processing decreased. For solving this problem, simplification
    problem has been suggested. Surface simplification problem is a fundamental problem in computational geometry and it has many applications in other fields such as GIS, computer graphics, and image processing. Major goal of simplification problems is reducing stored information in any surface, Because it improves speed of processes. One of common types in this field is 3D terrain simplification while error of simplified surface be acceptable. Simplification is NP-Hard problem. In this project, we propose several new approximation and heuristic algorithms for 3D terrain simplification. Most significant of this thesis is “Weighted Triangulated Irregular Network Simplification” that no body seriously has worked on it. In this case, all of points triangulate and any triangle has certain cost, this is the main difference between 3D terrain and weighted TIN. In this context, we propose one heuristic algorithm. Lastly, we implement some of offered algorithms and test them on real datas
  9. Keywords:
  10. Simplification ; Approximate Algorithm ; Heuristic Algorithm ; Terrain ; Triangulated Irregular Network Terrian (TIN) ; Weighted Shortest Path

 Digital Object List

 Bookmark

No TOC