Using triangles to partition a disk (Q1814017)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using triangles to partition a disk |
scientific article; zbMATH DE number 5638 |
Statements
Using triangles to partition a disk (English)
0 references
25 June 1992
0 references
The problem of imbedding sets in \(E^ 2\) using a small number of line segments is of interest while considering linear imbeddings of simplicial complexes in \(E^ 2\). It is shown that any partition of a disk into \(n\) subdisks has a shingled imbedding in \(E^ 2\); that is, an imbedding obtained by laying down \(n\) triangles, one after another. As a corollary to this, it is observed that every partition of a disk into \(n\) subdisks can be imbedded in \(E^ 2\) using \(2n+1\) line segments.
0 references
linear imbeddings
0 references
simplicial complexes
0 references
disk
0 references
subdisks
0 references
shingled imbedding
0 references
0.7490084767341614
0 references
0.7019587755203247
0 references
0.6983928084373474
0 references
