Computer Science – Computational Geometry
Scientific paper
2006-09-25
Computer Science
Computational Geometry
14 pages
Scientific paper
An O(n) test for polygon convexity is stated and proved. It is also proved
that the test is minimal in a certain exact sense.
No associations
LandOfFree
Polygon Convexity: A Minimal O(n) Test does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Polygon Convexity: A Minimal O(n) Test, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polygon Convexity: A Minimal O(n) Test will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-15297