Warning
This page is located in archive.

Table of Contents

( home | lectures | seminars | presentations | upload | links )

Presentations

List of available topics

the specific date may change.

No. Date Student Topic
1. 26. 9. xxxxxxxx
2. 3.10. xxxxxxxx
3. 10.10. Jakub Profota [1] 2D range tree construction and range tree search [PREPARATA 77-87, Mount (75-)79-81, Berg 99-120]. Focus on a demonstration example or an applet. Do not repeat Lecture 3.
Kristián Domažlický [44] Halfedge data structure in OpenMesh library. Demo of ovelap of planar subdivisions.
4. 17.10. Rajeshkhannan Rithanya [21] Overlap of planar subdivisions. [Berg 33-39]
Adrian Filcík [6] Triangular method for planar search (Kirkpatrick's Planar point location) [PREPARATA 57-60, Mount 116-120].
5. 24.10. Vít Gardoň [9a] Convex Hull of a simple polygon: algorithm of Lee] [PREPARATA 166-171]
Tereza Hlavová [9b] Convex Hull of a simple polygon: algorithm of Melkman [PREPARATA 166-171]
6. 31.10. Matvii Bunin [7] Overmars and van Leeuwen algorithm of dynamic convex hull. [PREPARATA 118-125]. Detailed example.
Matěj Gargula [8] Beneath-beyond method (horní-dolní) [PREPARATA 131-140].
7. 7.11. Josef Bacík [11] Diameter of a point set. [PREPARATA 178-183].
Richard Kvasnica [23] Kernel of a Polygon [Lee]
8. 14.11. Kamila Zeleňáková [13] Largest empty circle [PREPARATA 248-254]
Jakub Sakař [12] Smallest enclosing circle. [Berg 86-89, Mount20 135-140, PREPARATA 248-254] Impementace
9. 21.11. Valentin Lhermitte [14] k-th order Voronoi diagram. [PREPARATA 242-246].
Ivan Desiatov [44] Variants of Voronoi diagram - different metrics, weights, and site shapes applets (use appletviewer from jdk 10)
10. 28.11. Richard Smělý [18] D&C Algorithm of Delaunay triangulation: DeWall algorithm. [ Cignoni, Maur '02, 15-17].
— [43] Quad edge data structure and its usage for storage of DT and VD.[Rourke 147-149,199, Guibas&Stolfi], Overview
11. 5.12. Gaétan Bou [25] Algorithm for computation of the perimeter of a union of rectangles. [PREPARATA 340-347]
Jan Blahoš [26] Algorithm for computation of the intersection of rectangles. [PREPARATA 351-357]
12. 12.12. Lukáš Cezner [35] Intersection of convex polygons. [O'Rourke 242-252]
Vojtěch Vaněček [22] Minimum spanning tree in Eucledian space.
13. 19.12. Petr Jahoda [37] Partition trees and a simplex method [Berg 335-343]
Yevhenii Basov [38] Cutting trees [Berg 346-353]
14. 9.1. Dan Rakušan [39] Kinetic data structures - introduction - kinetic convex hull Razzazi
Jaroslav Jelínek [36] Robot motion planning [Berg 283-290]

Literature

[Berg, Mount, O'Rourke, Preparata] viz úvodní stránka

[Mulmuley] K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, New York, 1993

[Maur] Maur, P: Delaunay Triangulation in 3D. State of the Art and Concept of Doctoral Thesis, ZCU 2002

courses/cg/presentations/start.txt · Last modified: 2024/12/05 09:01 by felkepet