Google Answers Logo
View Question
Q: Triangulation, convex hull, and linear time intersection ( No Answer,   0 Comments )
Subject: Triangulation, convex hull, and linear time intersection
Category: Computers > Algorithms
Asked by: nr9-ga
List Price: $2.00
Posted: 07 Jun 2006 18:51 PDT
Expires: 10 Jun 2006 06:16 PDT
Question ID: 736281
The pockets of a simple polygon are the areas outside the polygon, but
inside its convex hull. Let P1 be a simple polygon with m vertices,
and assume that a triangulation of P1 as well as its pockets is given.
Let P2 be a convex polygon with n vertices. Show that the intersection
of P1 and P2 can be computed in O(m+n) time.
There is no answer at this time.

There are no comments at this time.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at with the question ID listed above. Thank you.
Search Google Answers for
Google Answers  

Google Home - Answers FAQ - Terms of Service - Privacy Policy