Abstract
In this paper, we study the computation of 2-dimensional convex hull of a set of points whose positions are inaccurate, that is, known only up to a given accuracy. To compute accuracy guaranteed results from such an imprecise input, we consider two types of convex hull, inner convex hull and outer convex hull which are defined as the intersection and the union of all possible convex hulls. The gap of these two hulls explicitly represents the accuracy of a possible convex hull. Under an assumption that the size of error is given for each input point, we show that the inner convex hull and the outer convex hull are calculated in O(n log n) time for n points in the plane.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
