Computing in linear time a chord from which a simple polygon is weakly internally visible (Q6487941)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing in linear time a chord from which a simple polygon is weakly internally visible |
scientific article; zbMATH DE number 7666495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing in linear time a chord from which a simple polygon is weakly internally visible |
scientific article; zbMATH DE number 7666495 |
Statements
Computing in linear time a chord from which a simple polygon is weakly internally visible (English)
0 references
21 March 2023
0 references
0 references
0 references
0.9104397296905518
0 references
0.8781488537788391
0 references
0.8334757089614868
0 references
