Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264)
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 boundary cycle of a pseudo-triangle polygon from its visibility graph |
scientific article; zbMATH DE number 7316483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing boundary cycle of a pseudo-triangle polygon from its visibility graph |
scientific article; zbMATH DE number 7316483 |
Statements
Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (English)
0 references
1 March 2021
0 references
