Polygon Convexity: A Minimal O(n) Test

Computer Science – Computational Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-15297

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.