Abstract
This paper presents a randomized parallel algorithm for computing planar Voronoi diagrams of n point sites according to symmetric convex distance functions. This algorithm uses, with high probability, O(n log(n)/p) local computation time and O(n/p) space on the processors plus time for O(1) communication rounds on a coarse grained multicomputer with p processors.
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.
