Efficient regular polygon dissections

DOI10.1007/978-3-540-46515-7_14MaRDI QIDQ4504023zbMATH OpenFDO

Authors J. Urrutia, Evangelos Kranakis, D. Krizanc

Publication date 6 December 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-46515-7_14

zbMATH Keywords

dissectionsglass-cutsguillotine cutspolygonal cutsregular polygonssquares

Mathematics Subject Classification ID

Dissections and valuations (Hilbert's third problem, etc.) (52B45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Review text

The authors study the problem of dissecting a regular \(m\)-gon into a small number of pieces that can be arranged to form a regular \(n\)-gon of the same area. In particular, the case is considered in which one of the shapes is a square. If the dissection is formed by a series of ``edge-to-edge or glass-cuts (also known as guillotine cuts), it is shown that \(n/2+o(n)\) cuts are sufficient to dissect a square into a regular \(n\)-gon, while \(\lceil n/2\rceil-2\) cuts may be necessary. For the case of general polygonal cuts, an upper bound of \(n/2+o(n)\) cuts is shown, while the lower bound is only \(\lceil n/4\rceil\). For the more general case, similar bounds are derived. For the entire collection see [Zbl 0933.00046].

Recommendations

• Efficient regular polygon dissections
• Reflecting Well: Dissections of Two Regular Polygons to One
• \((1+n)\) sequential dissection of a rectangle into \(m\)-gons, \(m\in \{ 3,5,6,7,8 \}\)
• Sequentially divisible dissections of simple polygons
• Equidissections of polygons

Cited in

(18)

• Efficient regular polygon dissections
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• \((1+n)\) sequential dissection of a rectangle into \(m\)-gons, \(m\in \{ 3,5,6,7,8 \}\)
• Dissection with the fewest pieces is hard, even to approximate
• Complete dissections: converting regions and their boundaries
• Reflecting Well: Dissections of Two Regular Polygons to One
• The problem of best cut of regular polygons
• Crazy Cuts: Dissecting Planar Shapes into Two Identical Parts
• scientific article; zbMATH DE number 4009228 (Why is no real title available?)
• Fast computation of the modality of polygons
• A note on the purely recursive dissection for a sequentially n-divisible square
• Sequentially divisible dissections of simple polygons
• Rectilinear glass-cut dissections of rectangles to squares
• Cutting Corners: A Four-gon Conclusion
• Lattice dissections: plainer and less fancy
• Hole dissections for planar figures
• Proof Without Words: A Pattern Block Dissection to Square the Regular Dodecagon
• Orthogonal dissection into few rectangles

This page was built for publication: Efficient regular polygon dissections

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