Generation of Delaunay triangulations

Nazev prn.cc: Genorovani Delaunayho triangulaci Autor: Michal Zajae Katedra: Katedra numericke inalematiky Vcdonci bakalafske prace: Doe. Mgr. Petr Knobloch, Dr. e-mail vedouu'ho: Petr.Knobloclh'dmrf.cuni.c/ Abstract: Cilein teto bakalafske pracc jo vytvofit software na generovani Delaunayho triangnlaci. Vyehazi z algoritmn nvedeneho v elnnkii [2], Pro- gram je implemontovany pro vsc^lmy \r/ivatclcin zadane konvexni obhusti, pro kruhy, dale j.scni im]>leniento\an(.'' kruhove vyfc/.y danych obla,sti. Vy- stu]) tvofi dva soubory Hiindno ])ouzitelne v zda.rma dostiipnem ])rogramn Gnuplot. Jeden ob.salmje trojuhelniky tvofici Dolaunayho tria.ngnln.ci, druhy usecky tvofici Voronoiho mnohoi'ihelniky. Praco ohsahnje grafy nekolika tes- tova,cieh oblasti. Jsou zde pcjjwanc ])roblemy, kterc se belunn implemenitacc objevily. Klicova ylova: Delaunay. triangulaee, Voronoi, teselace Title: Generation of Delaunay triangulations Author: Michal Za.jac Depa,rtment: Dupa.rtment of Numerical Mathematics Supervisor: Doc. Mgr. Petr Knobloeh, Dr. Supervisor's e-mail nddress: Petr.KnobloehC'Linff.cimi.c/ Abstract: The aim of this work is to create software for generating Delaunay triangnla.tions. The algorithm is described in the article [2]. The program is implemented for any convex or circle domain given by user. Domains with..