How would you find the area of a polygon in O(n) time? Of course thereis this way of using the formula, but it doesnt quite work out in case of Self intersecting polygons. One could maybe divide it into triangles and then solve it, but that'd require for one to sort the vertices first which would take O(n logn) time. Is there anyway one could maybe use preprocessing or any sort of transformations so as to obtain the area in O(n) time?
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
