Go to menu
,
Go to content
,
Go to footer
Computational Geometry
Faculty of Natural Science at Masaryk University
doc. RNDr. Martin Čadek, CSc.
česky
in English
Introduction
1. Convex hull in the plane
2. Line segment intersection via sweep algorithm
3. Map overlay
4. Polygon triangulation
5. Half-plane intersection
6. Linear programming
7. Orthogonal range searching
8. Point location
9. Voronoi Diagrams
10. Delaunay Triangulation
References
References
M. de Berg, O. Cheong, M. van Kreveld, M. Overmars,
Computational Geometry, Algorithms and Applications
, Third Edition, 2008, Springer
O. Folvarčný,
Point Location
(in Czech), Bachelor thesis, 2009, Masaryk University, available from: <
https://is.muni.cz/auth/th/211164/prif_b?lang=en
>.
P. Halová,
Robot Motion Planning
(in Czech), Bachelor thesis, 2016, Masaryk University, available from: <
https://is.muni.cz/auth/th/423946/prif_b?lang=en
>.
D. Janků,
Map overlay
(in Czech), Master thesis, 2014, Masaryk University, available from: <
https://is.muni.cz/auth/th/359588/fi_m?lang=en
>.
J. Kovář,
Algorithmic Approach to Liner Programming in the Plane
(in Czech), Bachelor thesis, 2011, Masaryk University, available from: <
https://is.muni.cz/auth/th/323609/prif_b?lang=en
>.
J. Tomšů,
On Algorithms of Computational geometry
(in Czech), Bachelor thesis, 2008, Masaryk University, available from: <
https://is.muni.cz/auth/th/t69k5?lang=en
>.