HOMEWORK 8: BOUNDING VOLUME HIERARCHY


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
the forum, etc.), and all of the resources (books, online reference
material, etc.) you consulted in completing this assignment.
This should not be "none"!

< 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 >



CORRECTNESS & PERFORMANCE ANALYSIS:
Summarize the performance of your implementation on a variety of
different input files and command line arguments.  Describe what you
see visually in SVG file.  How is the running time (use the unix
'time' command) of your program for detecting and omitting elements
that overlap with previously inserted data?  Compare your measurements
to the gathereed statistics.  Does it match your expectations?




EXTRA CREDIT: BVH CONSTRUCTION HEURISTICS
Explore and evaluate alternate methods of constructing or
incrementally inserting data to a BVH.



EXTRA CREDIT: ERASE
Discuss the implications of implementing and using erase on a BVH.
How does it compare to erase on a standard binary search tree?
Additionally, you can implement, test, and evaluate the performace of this
operation.
  


MISC. COMMENTS TO GRADER:  
(optional, please be concise!)