k-pairs non-crossing shortest paths in a simple polygon (Q6487450): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Ray shooting in polygons using geodesic triangulations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal shortest path queries in a simple polygon / 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: Computing minimum length paths of a given homotopy class / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Euclidean shortest paths in the presence of rectilinear barriers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3694703 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest Non-Crossing Rectilinear Paths in Plane Regions / rank | |||
Normal rank | |||
Revision as of 12:50, 3 December 2024
scientific article; zbMATH DE number 7645895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-pairs non-crossing shortest paths in a simple polygon |
scientific article; zbMATH DE number 7645895 |
Statements
k-pairs non-crossing shortest paths in a simple polygon (English)
0 references
25 January 2023
0 references
0 references
