302319 (v.1) Spatial Computations 182

Area:

Department of Spatial Sciences

Credits:

25.0

Contact Hours:

5.0

Lecture:

1 x 2 Hours Weekly

Other:

1 x 1 Hours Weekly

Tutorial:

1 x 2 Hours Weekly

Prerequisite(s):

302318 (v.1) Spatial Computations 181 or any previous version

Syllabus:

Further development of spatial data problem solving approaches. Design, implementation and analysis of data structures and algorithms for spatial data processing. Advanced spatial computations and object oriented solutions.

Unit Outcomes:

Upon completion of this unit students will have - Developed enhanced problem solving skills, designed and implemented advanced spatial algorithms and developed a working knowledge of the complexity and analysis of spatial algorithms, and of data structures and algorithms that are foundational to geographic information systems.

Text and references listed above are for your information only and current as of September 30, 2003. Please check with the unit coordinator for up-to-date information.

Unit References:

De Berg M (Ed), Van Kreveld M, Overmars M and Schwarzkopf O., (2000), Computational Geometry - Algorithms and Applications, Berlin, Springer-Verlag. Campione M, Walrath K and Huml A., (2001), The Java Tutorial - A short Course on the Basics, 3rd ed, Sun Microsystems. Van Kreveld M, Nievergelt J, Roos T and Widmayer P, (Eds)., (2000), Algorithmic Foundations of Geographic Information Systems, Berlin, Springer-Verlag.

Unit Texts:

Waite M and Lafore R., (1998), Data Structures and Algorithms in Java, Waite Group Pr.

Unit Assessment Breakdown:

Assignments 25%, Examination 50%, Test 25%. This is by grade/mark assessment.

Year	Location	Period	Internal	Area External	Central External
2004	Bentley Campus	Semester 2	Y	Y	Y