Download COMPUTATIONAL GEOMETRY, COMP 163, HOMEWORK 2 – Due: Monday, October 12.

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts
no text concepts found
Transcript 
COMPUTATIONAL GEOMETRY, COMP 163, HOMEWORK 2
– Due: Monday, October 12.
– Feedback on your work will be given asap after the due date. To ensure
better and more timely feedback, I recommend submitting your answers by
noon on Sunday the 11th.
Assume general position.
1. Prove or disprove that for every triangulation of n points, there exists
an edge that is the base of two triangles whose union forms a convex
quadrilateral. Assume general position, and n > 4.
2. Prove that every point x on the boundary of a non-convex polygon P
sees a reflex vertex of P . You can first assume that x is a vertex of P
and then argue why it doesn’t matter.
Related documents