COMP SCI 7402 - Introduction to Geometric Algorithms
North Terrace Campus - Semester 2 - 2018
General Course Information
Course Code COMP SCI 7402 Course Introduction to Geometric Algorithms Coordinating Unit School of Computer Science Term Semester 2 Level Postgraduate Coursework Location/s North Terrace Campus Units 3 Contact Up to 2 hours per week Available for Study Abroad and Exchange Y Prerequisites COMP SCI 7201 Assumed Knowledge Discrete mathematics such as in MATHS 1008 Course Description Introduction to Computational Geometry techniques. Topics include theoretical and applied aspects of computational geometry
Course Coordinator: Professor Chunhua Shen
The full timetable of all activities for this course can be accessed from Course Planner.
Course Learning OutcomesOn successful completion of this course students will be able to:
1 Explain the basic concepts of computational geometry and standard algorithms such as plane sweeping, linear programming, voronoi diagrams and Delaunay Triangulation. 2 Explain the basic principles and theory of geometric algorithms, which may guide students to develop their own algorithms for solving geometric problems. 3 Demonstrate the ability to implement the algorithms in the course. 4 Demonstrate the ability to do mathematical derivation of the algorithms in the course.
University Graduate Attributes
This course will provide students with an opportunity to develop the Graduate Attribute(s) specified below:
University Graduate Attribute Course Learning Outcome(s) Deep discipline knowledge
- informed and infused by cutting edge research, scaffolded throughout their program of studies
- acquired from personal interaction with research active educators, from year 1
- accredited or validated against national or international standards (for relevant programs)
1, 2 Critical thinking and problem solving
- steeped in research methods and rigor
- based on empirical evidence and the scientific approach to knowledge development
- demonstrated through appropriate and relevant assessment
1-4 Career and leadership readiness
- technology savvy
- professional and, where relevant, fully accredited
- forward thinking and well informed
- tested and validated by work based experiences
Required ResourcesThe main textbook used in the course is M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. This book is available online through the University of Adelaide library.
Online LearningAll course material including lecture sildes, assignment instructions, and lecture recordings, are available from the course homepage:
The course forum is accessible via:
Learning & Teaching Activities
Learning & Teaching ModesThe course will be primarily delivered through two activities:
Lectures will introduce and motivate the basic concepts of each topic. Significant discussions and two-way communication are also expected during lectures to enrich the learning experience. The assignments will reinforce concepts by their application to problem solving. This will be done via programming work, and mathematical derivation. All material covered in the lectures, and assignments are assessable.
The information below is provided as a guide to assist students in engaging appropriately with the course requirements.The information below is provided as a guide to assist students in engaging appropriately with the course requirements.
This is a 3-unit course. Students are expected to spend about 8 hours per week on the course. This includes a 2-hour lecture, 2-hour self study and up to 4 hours per week on completing assignments.
Assigmment work will be subjected to deadlines. Students are expected to manage their time effectively to allow timely submission, especially with consideration to workload of other courses.
Learning Activities SummaryStudents are encouraged to attend lectures as material presented in lectures often includes more than is on the slides. Students are also encouraged to ask questions during the lectures. Slides and lecture recordings will be available via the subject web page.
Week Date Topic Lecturer Assignment 1 29/07/2016 Computational Geometry - Introduction GC 2 05/08/2016 Line Segment Intersection - Thematic Map Overlay GC 3 12/08/2016 Line Segment Intersection cont. GC Assignment 1 (due on 26/08) 4 19/08/2016 Polygon Triangulation - Guarding an Art Gallery GC 5 26/08/2016 Linear Programming - Manufacturing with Molds GC 6 02/09/2016 Linear Programming cont. GC Assignment 2 (due on 16/09) 7 09/09/2016 Orthogonal Range Searching - Querying a Database GC 8 16/09/2016 Orthogonal Range Searching cont. GC 9 07/10/2016 Point Location - Knowing Where You Are JS 10 14/10/2016 Voronoi Diagrams - The Post Office Problem JS Assignment 3 (due on 28/10) 11 21/10/2016 Voronoi Diagrams - continued JS 12 28/10/2016 Delaunay Triangulations - Height Interpolation GC Assignment 4 (due on 11/11)
Specific Course RequirementsKnowing some basic mathematics and linear algebra would be helpful, but not essential. They will be covered when needed.
Ability to program in Matlab is required.
The University's policy on Assessment for Coursework Programs is based on the following four principles:
- Assessment must encourage and reinforce learning.
- Assessment must enable robust and fair judgements about student performance.
- Assessment practices must be fair and equitable to students and give them the opportunity to demonstrate what they have learned.
- Assessment must maintain academic standards.
Assessment Task Weighting (%) Individual/ Group Formative/ Summative Due (week)* Hurdle criteria Learning outcomes CBOK Alignment** Assignment 1 25 Individual Fomative and Summative Weeks 2-3 1. 2. 3. 4. Assignment 2 25 Individual Fomative and Summative Weeks 5-6 1. 2. 3. 4. Assignment 3 25 Individual Fomative and Summative Weeks 8-9 1. 2. 3. 4. Assignment 4 25 Individual Fomative and Summative Weeks 11-12 1. 2. 3. 4. Total 100
This assessment breakdown complies with the University's Assessment for Coursework Programs Policy.
**CBOK is the Core Body of Knowledge for ICT Professionals defined by the Australian Computer Society. The alignment in the table above corresponds with the following CBOK Areas:
1. Problem Solving1.1 Abstraction1.2 Design
2. Professional Knowledge2.1 Ethics2.2 Professional expectations2.3 Teamwork concepts & issues2.4 Interpersonal communications2.5 Societal issues2.6 Understanding of ICT profession
3. Technology resources3.1 Hardware & Software3.2 Data & information3.3 Networking
4. Technology Building4.1 Programming4.2 Human factors4.3 Systems development4.4 Systems acquisition
5. ICT Management5.1 IT governance & organisational5.2 IT project management5.3 Service management5.4 Security management
Assessment Related RequirementsStudents must obtain at least 50% of the overall marks to pass the course
Each student is expected to complete assignments in the form of report and programming work. The assignments must be completed individually and all submissions are to be made under the declaration of adherring to the academic honesty principles. Submissions will be subjected to plagiarism checks. This course has a zero-tolerance policy towards academic honesty violations. Offenders will be duly subjected to University procedures for dealing with academic honesty cases.
Proportion of that
Assessment 1 Formative
25% week 5 1,2,3,4 3 3 5 Assessment 2 Formative
25% week 8 1,2,3,4 3 3 5 Assessment 3 Formative
25% week 11 1,2,3,4 3 3 5 Assessment 4 Formative
25% week 14 1,2,3,4 3 3 5
Due Dates: The assignment due dates will be made available on the course website.
*CBOK categories are explained in section 4 of the ICT core body of knowlege. Numbers assigned correspond to the Bloom taxonomy (see page 26 of the same document).
Assignment solutions are to be submitted through the School of Computer Science's Moodle forum: http://forums.cs.adelaide.edu.au/course/
No physical submissions of work will be accepted unless specifically requested by the lecturer.
Marks will be capped for late submissions, based on the following schedule:
1 day late – mark capped at 75%
2 days late – mark capped at 50%
3 days late – mark capped at 25%
more than 3 days late – no marks available.
Extensions to due dates will only be considered under exceptional medical or personal conditions and will not be granted on the last day due, or retrospectively. Applications for extensions must be made to the course coordinator by e-mail or hard copy and must include supporting documentation – medical certificate or letter from the student counselling service.
Grades for your performance in this course will be awarded in accordance with the following scheme:
M10 (Coursework Mark Scheme) Grade Mark Description FNS Fail No Submission F 1-49 Fail P 50-64 Pass C 65-74 Credit D 75-84 Distinction HD 85-100 High Distinction CN Continuing NFE No Formal Examination RP Result Pending
Further details of the grades/results can be obtained from Examinations.
Grade Descriptors are available which provide a general guide to the standard of work that is expected at each grade level. More information at Assessment for Coursework Programs.
Final results for this course will be made available through Access Adelaide.
The University places a high priority on approaches to learning and teaching that enhance the student experience. Feedback is sought from students in a variety of ways including on-going engagement with staff, the use of online discussion boards and the use of Student Experience of Learning and Teaching (SELT) surveys as well as GOS surveys and Program reviews.
SELTs are an important source of information to inform individual teaching practice, decisions about teaching duties, and course and program curriculum design. They enable the University to assess how effectively its learning environments and teaching practices facilitate student engagement and learning outcomes. Under the current SELT Policy (http://www.adelaide.edu.au/policies/101/) course SELTs are mandated and must be conducted at the conclusion of each term/semester/trimester for every course offering. Feedback on issues raised through course SELT surveys is made available to enrolled students through various resources (e.g. MyUni). In addition aggregated course SELT data is available.
- Academic Support with Maths
- Academic Support with writing and speaking skills
- Student Life Counselling Support - Personal counselling for issues affecting study
- International Student Support
- AUU Student Care - Advocacy, confidential counselling, welfare support and advice
- Students with a Disability - Alternative academic arrangements
- Reasonable Adjustments to Teaching & Assessment for Students with a Disability Policy
Policies & Guidelines
This section contains links to relevant assessment-related policies and guidelines - all university policies.
- Academic Credit Arrangement Policy
- Academic Honesty Policy
- Academic Progress by Coursework Students Policy
- Assessment for Coursework Programs
- Copyright Compliance Policy
- Coursework Academic Programs Policy
- Elder Conservatorium of Music Noise Management Plan
- Intellectual Property Policy
- IT Acceptable Use and Security Policy
- Modified Arrangements for Coursework Assessment
- Student Experience of Learning and Teaching Policy
- Student Grievance Resolution Process
Students are reminded that in order to maintain the academic integrity of all programs and courses, the university has a zero-tolerance approach to students offering money or significant value goods or services to any staff member who is involved in their teaching or assessment. Students offering lecturers or tutors or professional staff anything more than a small token of appreciation is totally unacceptable, in any circumstances. Staff members are obliged to report all such incidents to their supervisor/manager, who will refer them for action under the university's student’s disciplinary procedures.
The University of Adelaide is committed to regular reviews of the courses and programs it offers to students. The University of Adelaide therefore reserves the right to discontinue or vary programs and courses without notice. Please read the important information contained in the disclaimer.