307421 (v.1) Spatial Algorithms 182

---

 

Area:	Department of Spatial Sciences
Credits:	12.5
Contact Hours:	3.0
Lecture:	1 x 1 Hours Weekly
Tutorial:	1 x 2 Hours Weekly
Prerequisite(s):	302318 (v.1) Spatial Computations 181
Syllabus:	Spatial algorithms and problem solving. Design, development and implementation of spatial algorithms in problem solving. Algorithms for point and polgon handling. Networking and graphing algorithms. Examples and applications.
Unit Outcomes:	On completion of this unit students will have - Further developed their problem-solving skills, designed, implemented and analysed spatial algorithms, with an understanding of their complexity and developed a working knowledge of data structures and algorithms that are foundational to geographic information science.
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:	Van Kreveld, M., Nievergelt, J., Roos, T. and Widmayer, P., ed.s (2000), Algorithmic Foundations of Geographic Information Systems. Springer and Verlag, Berlin. Waite, M. and Lafore, R. (1998), Data Structures and Algorithms in Java. Waite Group Productions.
Unit Texts:	De Berg, M, ed., Van Kreveld, M., Overmars, M. and Schwarzkopf, O. (2000), Computational Geometry: Algorithms and Applications. Springer and Verlag.
Unit Assessment Breakdown:	Assignments 25%. Examinations 60%. Quizzes 15%. This is by grade/mark assessment.
Year Location Period Internal Area External Central External 2004 Bentley Campus Semester 2 Y