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.
Intelligence & Robotics
ISSN 2770-3541 (Online)
Navigation
Navigation
Committee on Publication Ethics
https://members.publicationethics.org/members/intelligence-robotics
Portico
All published articles are preserved here permanently:
https://www.portico.org/publishers/oae/
