Abstract
For a set P of n points in the plane and a fixed integer \(k\geqslant 2\), we present algorithms for finding k bounded convex sets that cover P such that the total area or perimeter of the convex sets is minimized in time \(O(n^{2k(k-1)}\log ^2 n)\) and \(O(n^{k(k-1)}\log ^2 n)\), respectively. The algorithms can be applied to detect road intersections from the GPS traces of moving objects.
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.
