An addendum to parallel methods for visibility and shortest-path problems in simple polygons (Q2366233): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel methods for visibility and shortest-path problems in simple polygons / rank | |||
Normal rank | |||
Latest revision as of 18:10, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An addendum to parallel methods for visibility and shortest-path problems in simple polygons |
scientific article |
Statements
An addendum to parallel methods for visibility and shortest-path problems in simple polygons (English)
0 references
29 June 1993
0 references
Addendum to the authors' paper [ibid. 8, No. 5/6, 461-486 (1992; Zbl 0788.68143)].
0 references
visibility
0 references
polygons
0 references
computational geometry
0 references
parallel algorithms
0 references
