Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2105.00017

Negative 3D gadgets in origami extrusions with a supporting triangle on the back side

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

Abstract

In our previous two papers, we studied (positive) 3D gadgets in origami extrusions which create a top face parallel to the ambient paper and two side faces sharing a ridge with two simple outgoing pleats. Then a natural problem comes up whether it is possible to construct a `negative' 3D gadget from any positive one having the same net without changing the outgoing pleats, that is, to sink the top and two side faces of any positive 3D gadget to the reverse side without changing the outgoing pleats. Of course, simply sinking the faces causes a tear of the paper, and thus we have to modify the crease pattern. There are two known constructions of negative 3D gadgets before ours, but they do not solve this problem because their outgoing pleats are different from positive ones. In the present paper we give an affirmative solution to the above problem. For this purpose, we present three constructions of negative 3D gadgets with a supporting triangle on the back side, which are based on our previous ones of positive 3D gadgets. The first two are an extension of those presented in our previous paper, and the third is new. We prove that our first and third constructions solve the problem. Our solutions enable us to deal with positive and negative 3D gadgets on the same basis, so that we can construct from an origami extrusion constructed with 3D gadgets its negative using the same pleats if there are no interferences among the 3D gadgets. We also treat repetition/division of negative 3D gadgets under certain conditions, which reduces their interferences with others.

Explore related subjects

cs.CGmath.MG

Keep this discovery

BibTeXRIS

Mamoru Doi. 2021-04-30. Negative 3D gadgets in origami extrusions with a supporting triangle on the back side. https://arxiv.org/abs/2105.00017

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↗