k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (Q4682198): Difference between revisions
From MaRDI portal
Set profile property. |
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: Maintenance of configurations in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shortest Non-Crossing Rectilinear Paths in Plane Regions / rank | |||
Normal rank | |||
Revision as of 12:17, 10 June 2024
scientific article; zbMATH DE number 2174847
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON |
scientific article; zbMATH DE number 2174847 |
Statements
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (English)
0 references
10 June 2005
0 references
Non-crossing paths
0 references
simple polygon
0 references
polygon decomposition
0 references
geodesic triangulation
0 references
axis-parallel paths
0 references
0 references
