Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1908.07342

New efficient flat-back 3D gadgets in origami extrusions compatible with the conventional pyramid-supported 3D gadgets

Mamoru Doi
View original source ↗Read source document ↗Export metadata ↓

Abstract

An origami extrusion is a folding of a 3D object in the middle of a flat piece of paper, using 3D gadgets which create faces with solid angles. Our main concern is to make origami extrusions of polyhedrons using 3D gadgets with simple outgoing pleats, where a simple pleat is a pair of a mountain fold and a valley fold which are parallel to each other. In this paper we present a new type of 3D gadgets with simple outgoing pleats in origami extrusions and their construction. Our 3D gadgets are downward compatible with the conventional pyramid-supported gadgets developed by Calros Natan as a generalization of the cube gadget, in the sense that in many cases we can replace the conventional gadgets with the new ones with the same outgoing pleats while the converse is not always possible. We can also change angles of the outgoing pleats under certain conditions. Unlike the conventional pyramid-supported 3D gadgets, the new ones have flat back sides above the ambient paper, and thus we can make flat-foldable origami extrusions. Furthermore, since our new 3D gadgets are less interfering with adjacent gadgets than the conventional ones, we can use wider pleats at one time to make the extrusion higher. For example, we prove that the maximal height of the prism of any convex polygon (resp. any triangle) that can be extruded with our new gadgets is more than 4/3 times (resp. $\sqrt{2}$ times) of that with the conventional ones. We also present explicit constructions of division/repetition and negative versions of the new 3D gadgets.

Explore related subjects

cs.CGmath.MG

Keep this discovery

BibTeXRIS

Mamoru Doi. 2019-08-08. New efficient flat-back 3D gadgets in origami extrusions compatible with the conventional pyramid-supported 3D gadgets. https://arxiv.org/abs/1908.07342

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG↗
arXiv2026

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG↗
arXiv2026

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG↗