Link to Curtin homepage      CurtinSearch | Curtin Site Index 
Online handbook 2004
CoursesUnitsNew CoursesJoint Uni CoursesDefinition of TermsContact / Help
About Curtin University
Academic calendar
Admissions Information
Applying for a research higher degree
Applying to Curtin
Bookshop
Prospective student service
Curtin scholarships
Enrolment information
Fee Information
Grading system
IT Policy
Student rights and responsibilities
Student policy and procedures
    

302277 (v.1) Spatial Computations 582


 

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):

306454 (v.1) Spatial Computations 581 or any previous version

Other Requisite(s):

Admission: to the Graduate Diploma program.

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 knowledge of the complexity and analysis of spatial algorithms and of data structures and algorithms that are foundational to geographic information systems.

Texts and references listed below are for your information only and current as of September 30, 2003. Some units taught offshore are modified at selected locations. Please check with the unit coordinator for up-to-date information and approved offshore variations to unit information before finalising study and textbook purchases.

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, SunMicrosystems. 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.

Field of Education:

 31100 Geomatic Engineering (Narrow Grouping)

HECS Band (if applicable):

2  

Extent to which this unit or thesis utilises online information:

 Supplemental  

Result Type:

 Grade/Mark


Availability

YearLocationPeriodInternalArea ExternalCentral External
2004Bentley CampusSemester 2YYY

Area
External
refers to external course/units run by the School or Department, offered online or through Web CT, or offered by research.
Central
External
refers to external course/units run through the Curtin Bentley-based Distance Education Area

 
Click here for a printable version of this page

    

Picture of sun setting over Henderson Court on Curtin's Bentley Campus

 

Curtin crest