Figure3

Figure 3. Typical Voronoi diagrams with the indicated graph branch nodes and optimal point-connected path: (A) obstacles in points; and (B) obstacles in convex polygons. Orange stars: Starts and ends of the path.