Unfolding genus-2 orthogonal polyhedra with linear refinement (Q1684951): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Erik D. Demaine / rank
Normal rank
 
Property / author
 
Property / author: Robin Y. Flatland / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Horst Martini / rank
Normal rank
 
Property / author
 
Property / author: Erik D. Demaine / rank
 
Normal rank
Property / author
 
Property / author: Robin Y. Flatland / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Horst Martini / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2547304849 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1611.00106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfolding Manhattan towers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ununfoldable polyhedra with convex faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfolding Orthogonal Polyhedra with Linear Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon-unfolding orthogonal polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5427478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Edge-Unfolding One-Layer Lattice Polyhedra with Cubic Holes / rank
 
Normal rank

Latest revision as of 20:06, 14 July 2024

scientific article
Language Label Description Also known as
English
Unfolding genus-2 orthogonal polyhedra with linear refinement
scientific article

    Statements

    Unfolding genus-2 orthogonal polyhedra with linear refinement (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 December 2017
    0 references
    An unfolding of a polyhedron is produced by cutting surface in such a way that it can be flattened to a single, connected piece without any overlap. E.g., in an edge unfolding, the cuts are restricted to the polyhedron's edges, whereas in a general unfolding, cuts can be made anywhere on the surface. The class of orthogonal polyhedra consists of polyhedra whose edges and faces all meet at right angles. The authors prove that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron's edges). This can be seen as the first result on unfolding general orthogonal polyhedra beyond genus $\theta$. The presented unfolding algorithm relies on the existence of at most 2 special leaves in what we call the ``unfolding tree'' (which ties back to the genus). Thus, unfolding polyhedra of genus 3 and beyond will require new techniques. The question of whether all orthogonal polyhedra of genus greater than zero can be unfolded is still wide open. However, the authors take a significant step toward this goal.
    0 references
    grid unfolding
    0 references
    linear refinement
    0 references
    orthogonal polyhedron
    0 references
    genus 2
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references