Using triangles to partition a disk

DOI10.1016/0012-365X(90)90378-UMaRDI QIDQ1814017zbMATH OpenFDO

Authors Tom Knoblauch

Publication date 25 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(90)90378-U

zbMATH Keywords

disklinear imbeddingsshingled imbeddingsimplicial complexessubdisks

Mathematics Subject Classification ID

Partitions of sets (05A18) Planar graphs; geometric and topological aspects of graph theory (05C10)

Review text

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.

Recommendations

• Zerlegung von Dreiecken in Dreiecke mit Nebenbedingung. (Partition of triangles into subtriangles with side-conditions)
• scientific article; zbMATH DE number 3998653
• Cutting a set of disks by a line with leaving many intact disks in both sides
• On a partition into convex polygons

Cites work

• scientific article; zbMATH DE number 3047038 (Why is no real title available?)
• Linear Isotopies in E 2

Cited in

(1)

• Zerlegung von Dreiecken in Dreiecke mit Nebenbedingung. (Partition of triangles into subtriangles with side-conditions)

This page was built for publication: Using triangles to partition a disk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814017)