Shortest paths in simple polygons with polygon-meet constraints (Q2390305): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Shortest watchman routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zookeeper route problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Touring a sequence of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Euclidean Shortest Paths in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3535949 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watchman routes under limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the watchman route and zookeeper's problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest safari routes in simple polygons / rank
 
Normal rank

Latest revision as of 20:02, 1 July 2024

scientific article
Language Label Description Also known as
English
Shortest paths in simple polygons with polygon-meet constraints
scientific article

    Statements