Andrew, A.M., Another efficient algorithm for convex huns in two dimensions, Info Proc. ett. 8 (1979), 108-109.  Home/Search   Document Not in Database   Summary   Related Articles

....polygon) the convex hull is the smallest convex polygon containing all the points (or the polygon) A convex hull of a polygon is often a good first estimation for computing e.g. intersections or visibility. Computing the convex hull of a set of n points can be done in O(n log n) time ( see e.g. [1,6,14,20]) For a simple polygon there exists a quite complicated method for computing the convex hull in linear time. We will show that on a grid there exists a very simple linear time solution to both problems. We will only treat the problem of finding the convex hull of a set of points. The convex hull ....

Andrew, A.M., Another efficient algorithm for convex huns in two dimensions, Info Proc. ett. 8 (1979), 108-109.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC