Key words
Algorithms, Computational geometry, P170, P175, T120
Objectives
To gain insight in algorithms and data structures for geometric problems (discrete and combinatorial),
and to analyse their performance.
Topics
An introduction to computational geometry: fundamental techniques, convex hull, Voronoi diagrams
(and Delaunay triangulations), geometric searching and point location, polygon partitioning (a.o.
triangulation), intersection problems.
Prerequisites
Final objectives of Algoritmen I.
Final Objectives
The specific algorithms and data structures for computational geometry are related to the general
methods of Algoritmen I, and therefore their study increases most of the abilities obtained there.
Moreover, a new specific ability is added:
- General scientific abilities [AWC1]: Ability to think in a critical, creative and scientific fashion.
- General technical abilities [ATC2]: Ability to analyse engineering problems in a scientific way,
and to solve them. [ATC3]: Ability to perform scientific and technical tasks in an autonomous
way. [ATC4]: Ability to use research methods and techniques to solve engineering problems.
- Specific abilities [SC10]: Ability to obtain knowledge and insight in present-day scientific
research in computer science. [SC14]: Ability to implement and apply advanced, and specific
algorithms and data structures.
Materials used
::Click here for additional information::
Handouts.
Study costs
Copy costs.
Study guidance
Lecturer is available by appointment.
Teaching Methods
Lectures.
Assessment
Oral examination.
Lecturer(s)
Rudy STOOP.
|
|
