1 / 16

Lecture 6 Start of Part II Material Monday, 2/4/01

UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001. Lecture 6 Start of Part II Material Monday, 2/4/01. Part 1. Part 2. Course Structure: 2 Parts. Advanced Topics Applications Manufacturing Modeling/Graphics

haile
Télécharger la présentation

Lecture 6 Start of Part II Material Monday, 2/4/01

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. UMass Lowell Computer Science 91.504Advanced AlgorithmsComputational GeometryProf. Karen DanielsSpring, 2001 Lecture 6 Start of Part II Material Monday, 2/4/01

  2. Part 1 Part 2 Course Structure: 2 Parts Advanced Topics Applications Manufacturing Modeling/Graphics Wireless Networks Visualization Techniques (de)Randomization Approximation Robustness Representations Epsilon-net Decomposition tree Basics Polygon Triangulation Partitioning (2D and 3D) Convex Hulls Voronoi Diagrams Arrangements Search/Intersection Motion Planning

  3. Syllabus (updated) Part 2 Strategic Directions in Computational Geometry Working Group Report October, 1996 http://www.cs.brown.edu/people/rt/sdcr/report/report.html

  4. Literature for Part II (current plan)

  5. Literature for Part II (current plan)(continued)

  6. Project Deliverable Due DateGrade % Proposal Monday, 4/9 2% Interim Report Monday, 4/23 5% Final Presentation Monday, 5/7 8% Final Submission Monday, 5/14 10% 25% of course grade

  7. Project Guidelines: Proposal • Objective: State the goal of the project • Plan: List the tasks you need to accomplish and the date by which you plan to finish them • Resources: What do you need? • Specialized equipment, language, OS? • Specialized software/libraries? • Additional research papers, books? • More background in some area? • Assessment Checklist: Characterize your project (see next 2 slides)

  8. Guidelines: Proposal (continued) • Assessment Checklist: • Characterize your project’s theoretical aspects: • Algorithmic Paradigm Design • Analysis Technique Design • Algorithm Design • Data Structure Design • Algorithm and/or Data Structure Analysis • correctness • running time and/or space • Observations/Conjectures Clarity Difficulty Scope Creativity Organization Impact Correctness

  9. Guidelines: Proposal (continued) • Assessment Checklist: • Characterize your project’s implementation aspects: • Reuse of existing Code/Libraries • New Code • Experimental Design • Test Suites • Degenerate/boundary cases • Numerical robustness Clarity Difficulty Scope Creativity Organization Impact Correctness

  10. Guidelines: Final Submission • Abstract: Concise overview (at most 1 page) • Introduction: • Motivation: Why did you choose this project? • Related Work: Context with respect to CG literature • Summary of Results • Main Body of Paper: (one or more sections) • Conclusion: • Summary: What did you accomplish? • Future Work: What would you do if you had more time? • References: Bibliography (papers, books that you used) Well- written final submissions with research content may be eligible for publishing as UMass Lowell CS technical reports.

  11. Guidelines: Final Submission • Main Body of Paper: • If your project involves Theory/ Algorithm: • Informal algorithm description (& example) • Pseudocode • Analysis: • Correctness • Solutions generated by algorithm are correct • account for degenerate/boundary/special cases • If a correct solution exists, algorithm finds it • Control structures (loops, recursions,...) terminate correctly • Asymptotic Running Time and/or Space Usage

  12. Guidelines: Final Submission • Main Body of Paper: • If your project involves Implementation: • Informal description • Resources & Environment: • what language did you code in? • what existing code did you use? (software libraries, etc.) • what equipment did you use? (machine, OS, compiler) • Assumptions • parameter values • Test cases • tables, figures • representative examples

  13. Guidelines: Interim Report • Structured like Final Submission, except: • no Abstract or Conclusion • fill in only what you’ve done so far • can be revised later • include a revised proposal if needed • identify any issues you have encountered and your plan for resolving them

  14. Guidelines: Presentation • 1/2 hour class presentation • Explain to the class what you did • Structure it any way you like! • Some ideas: • slides (electronic or transparency) • demo • handouts

  15. Project Topics (some possibilities) • Build on a Part I assignment, such as random point assignments in 2D or 3D • Navigate based on line arrangement to do combinatorially-based overlap increase or reduction • Visualization: Can geometric duality help with parallel coordinate representation of high-dimensional data?

  16. Project Topics (some possibilities) • Dynamic Wireless Channel Assignment: • design a heuristic that, given an assignment of frequencies to regions, transforms it into another assignment that: • satisfies a given demand level (number of frequencies) for each region • respects a separation constraint • “minimizes” the number of frequencies • ‘minimizes” the number of frequency reassignments

More Related