Menú local
Syllabus 2013-14 - 13313001 - Geometric Algorithms (Algoritmos geométricos)
- Level 1: Tutorial support sessions, materials and exams in this language
- Level 2: Tutorial support sessions, materials, exams and seminars in this language
- Level 3: Tutorial support sessions, materials, exams, seminars and regular lectures in this language
| DEGREE: | Grado en Ingeniería informática |
| FACULTY: | SCHOOL OF ENGINEERING OF JAÉN |
| ACADEMIC YEAR: | 2013-14 |
| COURSE: | Geometric Algorithms |
| NAME: Geometric Algorithms | |||||
| CODE: 13313001 | ACADEMIC YEAR: 2013-14 | ||||
| LANGUAGE: English | LEVEL: 2 | ||||
| ECTS CREDITS: 6.0 | YEAR: 4 | SEMESTER: SC | |||
- Geometric data types in 2D and 3D
- Classes of geometric data
- Programming paradigms for geometric algorithms : divide and conquer, Incremental and Sweep line
- The convex hull
- S patial data structures
- Definition and creation of spatial data structures in 2D and 3D : Grids, kd-trees, range-trees, quadtrees, octrees, etc.
- Basic functions
- T essellations
- PSLG
- Cloud points: triangulations, Delaunay
- Location and proximity problems
- Point enclosure
- The Voronoi diagram. Proximity graphs
- The chain method
- Intersections
- Intersections of planes, segments lines and polygons
- Sweep line for intersection of segment lines
- Aplication to GIS, collision detection and visibility
- Vectorial and raster terrain definition
- Data structure and algorithms for collision detection: wide and narrow phases.
- Data structure and algorithms for visibility. Hidden surface removal, Ray-shooting.
The methodology consists of the following activities:
- Lectures: presentation of theoretical concepts and problem-solving exercises
- Practical sessions: scheduling algorithms and applications for solving geometric problems
- Collective tutorials: solving exercises and doubts
Students with special educational needs should contact the Student Attention Service (Servicio de Atención y Ayudas al Estudiante) in order to receive the appropriate academic support
The subject is exceeded if the total count of all parts detailed in the Evaluation System has a value equal to or greater than 5 points.
Furthermore, the class attendance must be at least 50% of the total number of theoretical and practical classes. The theoretical exam must score at least 5 points, computing 40% of the final score.
Throughout the course a set of of theoretical and theoretical-practical exercises are proposed, counting 10% of the total grade .
The regular attendance and class participation counted another 10%.
- Computational geometry and computer graphics in C++. Edition: -. Author: Laszlo, Michael J.. Publisher: Upper Saddle River: Prentice Hall, cop. 1996 (Library)
- Computational Geometry: Algorithms and Applications. Edition: 3rd ed.. Author: -. Publisher: Berlin [etc.] : Springer-Verlag, 2008 (Library)
- Computational geometry in C. Edition: 2nd ed. Author: O'Rourke, Joseph. Publisher: Cambridge: Cambridge University Press, 2001 (Library)
- Spatial tessellations: concepts and applications of Voronoi diagrams. Edition: 2nd ed. Author: -. Publisher: Chichester [etc.]: John Wiley & Sons, cop. 2000 (Library)
- Geometric tools for computer graphics [Recurso electrónico]. Edition: -. Author: Schneider, Philip J.. Publisher: Amsterdam ; Boston : Morgan Kaufmann Publishers, 2003. (Library)
- Practical algorithms for 3D computer graphics. Edition: -. Author: Ferguson, R. Stuart. Publisher: Natick (Massachusetts): A K Peters, 2001 (Library)
- Foundations of multidimensional and metric data structures . Edition: -. Author: Samet, Hanan. Publisher: Amsterdam : Elsevier : Morgan Kaufmann, cop. 2006 (Library)
- Algorithmic foundations of geographic information systems. Edition: -. Author: -. Publisher: Berlin ; Barcelona [etc.]: Springer, cop. 1997 (Library)