Abstract
This paper is concerned with the efficient computation of additively weighted Voronoi cells for applications in molecular biology. We propose a projection map for the representation of these cells leading to a surprising insight into their geometry. We present a randomized algorithm computing one such cell amidst n other spheres in expected time O(n 2 log n). Since the best known upper bound on the complexity such a cell is O(n 2), this is optimal up to a logarithmic factor. However, the experimentally observed behavior of the complexity of these cells is linear in n. In this case our algorithm performs the task in expected time O(n log2 n). A variant of this algorithm was implemented and performs well on problem instances from molecular biology.
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.
