COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q725596 |
Changed an Item |
||
| Property / author | |||
| Property / author: Asish Kumar Mukhopadhyay / rank | |||
Normal rank | |||
Revision as of 16:37, 20 February 2024
scientific article; zbMATH DE number 1526827
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON |
scientific article; zbMATH DE number 1526827 |
Statements
COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (English)
0 references
7 November 2000
0 references
polygon
0 references
weak visibility
0 references
external visibility
0 references
shortest visible line segment
0 references
