Extend the classic Voronoi idea to a polygon world with geodesic distance.
This work develops and analyzes an algorithm to compute the geodesic Voronoi diagram for a set of point sites inside a simple polygon. Distance is measured by the length of the shortest internal paths, making this a new kind of metric geometry with practical algorithmic insights.
The author shows how to build the diagram efficiently, avoiding the heavy cost of computing full shortest-path trees. The approach combines divide-and-conquer, a careful extension step through the polygon, and a merging process that yields a diagram with linear size relative to the polygon and sites. The result is a concrete, step-by-step method that highlights both the structure of geodesic Voronoi diagrams and the challenges of working inside a polygonal world."synopsis" may belong to another edition of this title.
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780332802152
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LX-9780332802152
Quantity: 15 available