UNSW Handbook Course - Geometric and Graph Theoretic Data Processing

Geometric and Graph Theoretic Data Processing - COMP6731


	Faculty: Faculty of Engineering
	School: School of Computer Science and Engineering
	Course Outline: http://www.cse.unsw.edu.au/~cs6731
	Campus: Kensington Campus
	Career: Undergraduate
	Units of Credit: 6
	EFTSL: 0.12500 (more info)
	Indicative Contact Hours per Week: 0
	Enrolment Requirements:
	Prerequisite: COMP2911.
	CSS Contribution Charge:Band 2 (more info)
	Tuition Fee:See Tuition Fee Schedule
	Further Information: See Class Timetable

Description

Scope of topics to be covered:

Geometry
- orthogonal and simplex search
- proximity search
- point location
- binary and adaptive space partition
- motion planning and patterns
* properties/constraints that simplify required structures

Graph Theory
- connectivity
- planarity
- flow, transshipment, and transportation problems
- chromatic number
- isomorphism
- disjoint paths and cycles
- centrality
- distances and eccentricity
* properties/constraints that affect the above properties.

API use and development
- collection APIs
- generics
- design, implementation, documentation and deployment.

URL for this page:

© The University of New South Wales (CRICOS Provider No.: 00098G), 2004-2011. The information contained in this Handbook is indicative only. While every effort is made to keep this information up-to-date, the University reserves the right to discontinue or vary arrangements, programs and courses at any time without notice and at its discretion. While the University will try to avoid or minimise any inconvenience, changes may also be made to programs, courses and staff after enrolment. The University may also set limits on the number of students in a course.