KTH
/ Urban Planning /
Geoinformatics /
Courses /
GIS Architecture
AG2411 GIS Architecture and Algorithms
| Course Instructor: |
Takeshi Shirabe, shirabe(a)abe.kth.se |
| Teaching Assistant: |
Alexander Jacob, jacob(a)abe.kth.se |
| |
|
| Prerequisites: |
AG1323
GIS for the Built Environment, 5c, or equivalent. |
Latest News
Course Literature
The following literature is required:
1. Worboys, M. F., and M. Duckham, 2004. GIS: A Computing Perspective, 2nd edition. Taylor & Francis. Available from KTH bookstore (THS Bokhandeln).
2. R. K. Ahuja, T.L. Magnanti, and J.B. Orline, 1993, Network flows: Theory, Algorithms and Applications, Prentice Hall
Reading instructions and a list of optional literature will be handed out during the first lecture.
Course Description
By completing the course, the student should:
* be familiar the architecture of a GIS systems,
* have knowledge about the theory behind the most common algorithms in geographic information science,
* have knowledge about methods to handle geometric data in databases,
* have the confidence and skill to develop their own programming to implement new GIS applications,
* know the basic standards in GIS
To pass this course, the students are required to:
- complete all the exercises (LAB1:4.5c) and
- pass the written exam (TEN1:3c).
The written examination will be held on Tuesday 15 December, 9.00-13.00 in room V01.
Laboratory exercises
There are one or two laboratory sessions every week. Each session focuses on the
implemenation of data structures and/or algorithms introduced in its corresponding
lecture. For every session (except for the java introduction and project related sessions), a
report and relevant source codes are required to be submitted to the intructor through the
BILDA system by the specified due date.
Sofwatre
ArcGIS 9.3.1 (ESRI), Java JDK 6(Oracle) and Eclipse
Final Project
Every student is required to complete and present a final project that involves the
implementation of GIS data processing and/or their user interfaces.
There are three important dates. Aproject proposal must be accepted by the instructor no
later than November 26, 2010. The project report must be submitted to the instructor
through the BILDA system no laten than December 13, 2010 and presented during the
project presentation session on December 10, 2010.
External Materials
If you don't have basic ideas of Matlab, please download from BILDA the material to get a short introduction and self-study material of Matlab.
If you don't know ArcGIS, please download from BILDA the material to
get a short introduction and self-study material of ArcGIS.
___________________________________________________________________________
Lecture Schedule (Schedule may change)
|
| Date / Time |
Place |
Lecture Topic |
Reading |
| 2010-10-26 10-12 |
Q11 |
Introduction |
|
| 2010-10-29 10-12 |
L44 |
Map Algebra and its local operations |
Tomlin 1990,1991 |
| 2010-11-02 10-12 |
V12 |
Map Algebra's focal and zonal operations |
Tomlin 1990,1991 |
| 2010-11-02 10-12 |
Q11 |
Algorithms and their complexity |
AMO 56-63 |
| 2010-11-12 10-12 |
L44 |
Network data structures |
AMO 23-38 |
| 2010-11-23 10-12 |
Q11 |
Shortest path algorithms |
AMO 106-112, 133-143 |
| 2010-11-30 10-12 |
Q11 |
Other shortest path algorithms |
AMO 133-143, Caldwell 1961 |
| 2010-12-03 10-12 |
L44 |
Vector data structures and geometric algorithms |
WD Ch.5 |
| 2010-12-07 10-12 |
L22 |
Voronoi diagram and Delauny triangulation |
WD Ch. 5 |
| 2010-12-10 10-12 |
L21 |
Conclusion |
|
___________________________________________________________________________
Exercises (Schedule may change)
|
| Date / Time |
Place |
Exercise |
| 2010-10-26 13-17 |
GISLab |
E0: Introduction to Java |
| 2010-10-29 13-17 |
GISLab |
E1: Implementing routines to read and write raster data files |
| 2010-11-02 13-17 |
GISLab |
E2: Implementing routines to visualize raster data |
| 2010-11-05 13-17 |
GISLab |
E3: Implementing map algebraic operations |
| 2010-11-12 13-17 |
GISLab |
E4: Implementing routines to read and write network data files |
| 2010-11-19 13-17 |
GISLab |
Introduction to final project |
| 2010-11-23 13-17 |
GISLab |
Catch up session |
| 2010-11-26 13-17 |
GISLab |
E5: Implementing shortest path algorithms |
| 2010-11-30 13-17 |
GISLab |
Project session |
| 2010-12-03 13-17 |
GISLab |
Project session |
| 2010-12-07 13-17 |
GISLab |
Project session |
| 2010-12-10 13-17 |
GISLab |
Project presentation |
| 2010-12-14 09-13 |
Q36 |
Final exam |
Back to Geoinformatics course page
|
