An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (Q1380799): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29397229, #quickstatements; #temporary_batch_1706348838909 |
Created claim: DBLP publication ID (P1635): journals/dcg/KapoorMM97, #quickstatements; #temporary_batch_1731505720702 |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Sanjiv Kapoor / rank | |||
| Property / author | |||
| Property / author: Joseph S. B. Mitchell / rank | |||
| Property / author | |||
| Property / author: Sanjiv Kapoor / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Joseph S. B. Mitchell / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dcg/KapoorMM97 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:03, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane |
scientific article |
Statements
An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane (English)
0 references
11 March 1998
0 references
shortest path
0 references
