Abstract
The problem of constructing the geodesic Voronoi diagram for a set of sites S with a set of parallel line segments O as obstacles is addressed and an O ((m + n) log (m + n)) time and O (m + n) space algorithm is presented for constructing the diagram, where |S| = n and |O| = m. The algorithm is a plane-sweep algorithm which does not use geometric transformation. It uses two plane sweeps, advancing from two opposite directions, to produce two data structures, called the shortest path maps. The two maps are then tailored to produce the desired geodesic Voronoi diagram. When m = 0, the algorithm produces the original Voronoi diagram for the sites S in O(n log n) time and O (n) space, and when the sites in S are assigned weights, a minor modification of the algorithm can construct the weighted Voronoi diagram for S in O (n log n) time and O (n) space.
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.
