HOMEWORK 9: PRIORITY QUEUES FOR MESH SIMPLIFICATION
NAME: < insert name >
COLLABORATORS AND OTHER RESOURCES:
List the names of everyone you talked to about this assignment
(classmates, TAs, ALAC tutors, upperclassmen, students/instructor via
LMS, etc.), and all of the resources (books, online reference
material, etc.) you consulted in completing this assignment.
< insert collaborators / resources >
Remember: Your implementation for this assignment must be done on your
own, as described in "Academic Integrity for Homework" handout.
ESTIMATE OF # OF HOURS SPENT ON THIS ASSIGNMENT: < insert # hours >
ALGORITHM ANALYSIS:
Assume v_0 vertices, e_0 edges, and e_0 triangles in the initial mesh,
k edges connected to each vertex (average or worst case),
reduced to t_final triangles using the -shortest criteria.
What is the overall order notation for the program? Analyze the
separate compoenents of the program to justify your answer.
ALGORITHM ANALYSIS -- LINEAR:
ALGORITHM ANALYSIS -- PRIORITY QUEUE:
ALGORITHM ANALYSIS -- IMPACT OF -preserve_area command line argument?
Do your answers above change with or without the -preserve_area
command line argument? Describe.
EXTRA CREDIT: COLOR & OVERALL APPERANCE
Discuss the quality of your results in your README.txt and include
screenshots of your more impressive results. If you have submitted
screenshots, give the file names and describe the results.
MISC. COMMENTS TO GRADER:
Optional, please be concise!