Finding an approximate minimum-link visibility path inside a simple polygon (Q672401): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimal link visibility paths inside a simple polygon / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing the visibility polygon from a convex set and related problems / 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: Analysis of Christofides' heuristic: some paths are more difficult than cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum Cuts for Circular-Arc Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear time algorithm for minimum link paths inside a simple polygon / rank | |||
Normal rank | |||
Revision as of 10:17, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding an approximate minimum-link visibility path inside a simple polygon |
scientific article |
Statements
Finding an approximate minimum-link visibility path inside a simple polygon (English)
0 references
28 February 1997
0 references
computational geometry
0 references
approximation algorithms
0 references
simple polygon
0 references
visibility path
0 references
minimum link path
0 references
