[Reply] Reply[Reply to all] Reply to all[Forward] Forward   [Move] [Copy] [Delete]   [Previous Item] [Next Item]   Close      Help

 From:           Peters, Tom                                                               Sent:               Fri 10/15/2004 9:55 AM
                 Peters, Tom; Alana Tuccillo; eric.borbely@uconn.edu;
                Michael.Crivello@uconn.edu; Rina.Shah@uconn.edu;
                CARLETON@COFFRIN.COM; mariusz_gola@comcast.net;
                Nicholas.J.Thompson@uconn.edu; DML1001@yahoo.com;
 To:            Chris.Puzzo@gmail.com; daniel.Fontaine@gmail.com;
                Toan.2.Nguyen-Dinh@uconn.edu; thaibinh.luong@uconn.edu; Yang,
                Zhi; nguyengochuy@hotmail.com; yanroy@comcast.net;
                Jeremy.Spitz@uconn.edu; QueenBeee777@yahoo.com;
                joshua.levinson@uconn.edu; bjorgejm@hotmail.com;
                Rina.Shah@huskymail.uconn.edu
 Cc:             grendelkhan@gmail.com

 Subject:        CSE275 Syllabus, HW4
 Attachments:
                                                                                                                     View As Web Page

 CSE 275, HW4, Due Tues, 10/26/04, hard copy, word & figure processed

 1. What additional input is needed to define extend bounding boxes
 from 2 dimensions to 3?  (1 pt)

 2. What is the complete, but minimal, list of conditions to ascertain
 whether two 3D bounding boxes are disjoint? (1 pt)

 3. While both the 3D and 2D bounding box algorithms execute in O(1) time,
 what is the time ratio that could occur between the 2D algorithm executing
 as quickly as possible versus the 3D algorithm taking as long as possible? (1 pt)

 3. Another alternative to culling with bounding boxes would be to
 enclose each 3D polyhedral object in its convex hull (the smallest
 convex polyhedron that contains the original object).  Assume the
 original object has N vertices.

 a.  What is the optimal time to construct such a 3D convex hull (in terms of N).
 You can look this up, but provide a reference (1 pt)

 b. What is the optimal time to test whether two 3D convext objects are disjoint (1 pt)
 You can look this up, but provide a reference

 c. Recall that the intersection of two polygons takes O(N^2) time.
 Call the four routines: Find3dConvex, BBox3d, Int2Poly, ConvexDisjoint.
 How would you integrate these four routines for most effective culling,
 specifically showing the sequence in which you would call them.  Explain your
 design (3 pts)

 4. When outcodes are used for 2D clipping, write out psedo-code to indicate
 what must be done to clip a line relative to the right most edge (2pts).
 Be careful to define all your variables.