Shortest paths of mutually visible robots

DOI10.1142/S0218195925500050MaRDI QIDQ6900741zbMATH OpenFDO

Authors Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen

Publication date 12 November 2025

Published in International Journal of Computational Geometry \& Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195925500050

zbMATH Keywords

shortest pathssimple polygonvisibility

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A linear-time algorithm for the geodesic center of a simple polygon
• Algorithms and Computation
• Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
• Computing the geodesic centers of a polygonal domain
• Elements of robotics
• Geodesic-preserving polygon simplification
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Memory-constrained algorithms for simple polygons
• Mutual visibility by luminous robots without collisions
• Space-time trade-offs for stack-based algorithms
• The geodesic diameter of polygonal domains
• The mutual visibility problem for fat robots
• Time-space trade-offs for triangulating a simple polygon
• Triangulating a simple polygon in linear time

This page was built for publication: Shortest paths of mutually visible robots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6900741)