Unit 056 - The TIN Model

Table of Contents

1. INTRODUCTION
1.1 The TIN model
1.2. Creating TINs

2. HOW TO PICK POINTS
2.1. Fowler and Little algorithm
2.2. VIP (Very Important Points) Algorithm
2.3. Drop heuristic

3. HOW TO TRIANGULATE A TIN
3.1. Distance ordering
3.2. Delaunay triangulation

4. ALTERNATIVE METHODS OF CREATING TINS
4.1 Break lines
4.2. TINs from contours

5. STORING TINS
5.1. Triangle by triangle
5.2. Points and their neighbors
5.3. Comparison of the two structures

6. ALGORITHMS ON TINS
6.1. Slope and aspect
6.2 Contouring
6.3. Finding Drainage Networks

7. REFERENCES

8. DISCUSSION AND EXAM QUESTIONS

Back to the Unit

Core Curriculum Outline