1 / 5

Algorithms Numbers in clammers [] refer to the literature

Algorithms Numbers in clammers [] refer to the literature. Each of these algorithms may be assigned only to one person. 1. Algorithm1 (Lectures, [1, pages 6-8]) / Assigned to Jakob Riekh.

mayda
Download Presentation

Algorithms Numbers in clammers [] refer to the literature

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. AlgorithmsNumbers in clammers [] refer to the literature Each of these algorithms may be assigned only to one person 1. Algorithm1 (Lectures, [1, pages 6-8]) / Assigned to Jakob Riekh 2. Algorithm2 (Lectures, [2],[3]) / Assigned to Florian Reiterer Convex Hull in 2d 3. Jarvis' March (internet, [2], [3]) / Assigned to Clemens Gugimaier 4. Gracham‘s Scan (internet, [2], [3]) / Assigned to Berhard Preis 5. Quick-Hull (internet) / Assigned to Christoph Bonitz 6. Divide and Conquere ([2, pages 145-147]) / Assigned to David Fischinger 7. Beneath-Beyond ([2, pages 147-158]) / Assigned to Johannes Kehrer

  2. Convex Hull in 3d Each of these algorithms may be assigned to 1 – 2 persons 8. Algorithm3 (Lectures, [1], [2], [3]) / Assigned to Sari & Tomitsch 9. Quick-Hull (internet) / Assigned to Schlöser & Meyer 10. Divide and Conquere ([2, pages 145-147]) / Assigned to Veronika & Philipp 11. Beneath-Beyond ([2, pages 147-158])

  3. Voronoi Diagram Each of these algorithms may be assigned to 1 – 2 persons 12. Algorithm4 (Lectures, [2]) 13. Algorithm5 (Lectures, [2]) 14. Fortune’s Algorithm ([1, page 149]) / Assigned to Clemens Nothegger

  4. Triangulation / Delaunay Triangulation/Point Location Each of these algorithms may be assigned to 1 – 2 persons 15. Polygon Triangulation ([1, §3]) / Assigned to Marian Kogler 16. Algorithm6 (Lectures (Delaunay T.), [2]) 17. Algorithm7 (Lectures (Delaunay), [1,§9]) / Assigned to Friedrich Slivovsky 18. Trapezoidal Map (Lectures, [1,§6])

  5. Student’s choice Johan Liesén: Find the point receiving the most light from n given light sources

More Related