COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON (Q4513233): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing shortest transversals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding transversals for sets of simple geometric figures / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On common transversals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple algorithm for determining the envelope of a set of lines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two counterexamples concerning transversals for convex subsets of the plane / rank | |||
Normal rank | |||
Latest revision as of 16:17, 30 May 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
0 references
