1. UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Lecture 1 Course Introduction

2. What is Computational Geometry?

3. Advanced Algorithms Computational Geometry Telecommunications Visualization 91.504 Manufacturing ComputerGraphics Design Analyze Apply CAD

4. Sample Application Areas Computer Graphics Geographic Information Systems Robotics Bioinformatics Astrophysics MedicalImaging Telecommunications Data Mining & Visualization

5. Typical Problems ä bin packing ä Voronoi diagram ä simplifying polygons ä shape similarity ä convex hull ä maintaining line arrangements ä polygon partitioning ä nearest neighbor search ä kd-trees SOURCE: Steve Skiena’s Algorithm Design Manual (for problem descriptions, see graphics gallery at ) (for problem descriptions, see graphics gallery at http://www.cs.sunysb.edu/~algorith)

6. Common Computational Geometry Structures Voronoi Diagram Convex Hull New Point source: O’Rourke, Computational Geometry in C Delaunay Triangulation

7. Sample Tools of the Trade Algorithm Design Patterns/Techniques: binary searchdivide-and-conquerduality randomizationsweep-line derandomizationparallelism Algorithm Analysis Techniques: asymptotic analysis, amortized analysis Data Structures: winged-edge, quad-edge, range tree, kd-tree Theoretical Computer Science principles: NP-completeness, hardness Growth of Functions Summations Recurrences Sets Probability MATH Proofs Geometry Graph Theory Combinatorics Linear Algebra

8. Computational Geometry in Context TheoreticalComputerScience Applied Computer Science AppliedMath Geometry ComputationalGeometryEfficient Geometric Algorithms Design Analyze Apply

9. Course Introduction Course Description

10. Web Page http://www.cs.uml.edu/~kdaniels/courses/ALG_504.html

11. Nature of the Course ä Elective graduate Computer Science course ä Theory and Practice ä Theory: “Pencil-and-paper” exercises ä design an algorithm ä analyze its complexity ä modify an existing algorithm ä prove properties ä Practice ä Programs ä Real-world examples

12. Course Structure: 2 Parts Basics Polygon Triangulation Partitioning Convex Hulls Voronoi Diagrams ArrangementsSearch/Intersection Motion Planning Advanced Topics (sample topics) (sample topics) (may change based on student interests) CoveringClusteringPacking Geometric Modeling Topological Estimation papers from literature

13. Textbook - - Required: ä Computational Geometry in C ä second edition ä by Joseph O’Rourke ä Cambridge University Press ä 1998 ä see course web site for ISBN number(s) & errata list can be ordered on-line Web Site: http://cs.smith.edu/~orourke/books/compgeom.html + conference, journal papers

14. Textbook Java Demo Applet Code functionChapter pointerdirectory ----------------------------------------------------- TriangulateChapter 1, Code 1.14/tri Convex Hull(2D)Chapter 3, Code 3.8/graham Convex Hull(3D)Chapter 4, Code 4.8/chull sphere.cChapter 4, Fig. 4.15/sphere Delaunay Triang Chapter 5, Code 5.2/dt SegSegIntChapter 7, Code 7.2/segseg Point-in-polyChapter 7, Code 7.13/inpoly Point-in-hedronChapter 7, Code 7.15/inhedron Int Conv PolyChapter 7, Code 7.17/convconv Mink ConvolveChapter 8, Code 8.5/mink Arm Move Chapter 8, Code 8.7/arm http://cs.smith.edu/~orourke/books/CompGeom/CompGeom.html

15. Prerequisites ä Graduate Algorithms (91.503) ä Coding experience in C, C++ ä Project coding may be done in Java if desired ä Standard CS graduate-level math prerequisites + high school Euclidean geometry ä additional helpful math background: ä linear algebra, topology Growth of Functions Summations Recurrences Sets Probability MATH Proofs Geometry

16. Syllabus (current plan)

18. Important Dates ä Midterm Exam:Wednesday, 3/7 ä Open books, open notes ä Final Exam:none If you have conflicts with exam date, please notify me as soon as possible.

19. Grading ä ä Homework35% ä ä Project35% ä ä Midterm (O’Rourke) 30% (open book, notes ) * *Some project writeups may be eligible for submission to a computational geometry conference.

20. Machine Accounts ä Each student will have an account on my machine: minkowski.cs.uml.edu. ä Username will be the same as your username on CS. ä Password will be your initials followed by the last 5 digits on the bottom right hand corner of the back of your student id card. ä To remotely log in, use a secure shell (e.g. ssh). ä To transfer files, use a secure FTP (e.g. sftp). ä LEDA and CGAL libraries are on minkowski.

21. Homework 1 W 1/24 W 2/7 O’Rourke Chapter 1 HW# Assigned Due Content

22. Course Introduction My Computational Geometry Research

23. My Previous Applied Algorithms Research ä VLSI Design: ä Custom layout algorithms for silicon compiler ä Geometric Modeling: ä Partitioning cubic B- spline curves ä Manufacturing: ä see taxonomy on next slide

24. Taxonomy of Problems Supporting Apparel Manufacturing OrderedContainment Geometric Restriction Distance-BasedSubdivision MaximumRectangle Limited Gaps MinimalEnclosure Column-Based Layout Two-Phase Layout LatticePacking Containment Maximal Cover

25. My Applied Algorithms Research Focus at UMass Lowell Telecommunications Data Mining, Visualization,Bioinformatics Manufacturing Design Analyze Apply for covering, assignment, clustering, packing, layout feasibility, optimization problems CAD