Unfolding Polyhedra

08/13/2019
by   Joseph O'Rourke, et al.
0

Starting with the unsolved "Dürer's problem" of edge-unfolding a convex polyhedron to a net, we specialize and generalize (a) the types of cuts permitted, and (b) the polyhedra shapes, to highlight both advances established and which problems remain open.

READ FULL TEXT

page 1

page 2

research
02/06/2020

Which convex polyhedra can be made by gluing regular hexagons?

Which convex 3D polyhedra can be obtained by gluing several regular hexa...
research
09/02/2017

Addendum to: Edge-Unfolding Nearly Flat Convex Caps

This addendum to [O'R17] establishes that a nearly flat acutely triangul...
research
11/06/2020

Advances and Open Problems in Backscatter Networking

Despite significant research in backscatter communication over the past ...
research
11/02/2021

Double pushout rewriting of C-sets

We generalize a pushout complement algorithm from graph rewriting to fin...
research
02/15/2023

Polar Zonohedra Edge-Unfold to Nets

This note proves that every polar zonohedron has an edge-unfolding to a ...
research
11/18/2019

Program synthesis performance constrained by non-linear spatial relations in Synthetic Visual Reasoning Test

Despite remarkable advances in automated visual recognition by machines,...

Please sign up or login with your details

Forgot password? Click here to reset