相关论文: Computational Geometry Column 36
In this paper we prove that a generic rational equation of degree $7$ is solvable by 2-fold origami. In particular we show how to septisect an arbitrary angle. This extends the work of Alperin & Lang and Nishimura on 2-fold origami.…
Determining visibility in planar polygons and arrangements is an important subroutine for many algorithms in computational geometry. In this paper, we report on new implementations, and corresponding experimental evaluations, for two…
Let $X$ be the product of two projective spaces and consider the general CICY threefold $Y$ in $X$ with configuration matrix $A$. We prove the finiteness part of the analogue of the Clemens' conjecture for such a CICY in low bidegrees. More…
We introduce sequences of functions orthogonal on a finite interval: proper orthogonal rational functions, orthogonal exponential functions, orthogonal logarithmic functions, and transmuted orthogonal polynomials
We develop recursion equations to describe the three-dimensional shape of a sheet upon which a series of concentric curved folds have been inscribed. In the case of no stretching outside the fold, the three-dimensional shape of a single…
Basic facts and definitions of conformal moduli of rings and quadrilaterals are recalled. Some computational methods are reviewed. For the case of quadrilaterals with polygonal sides, some recent results are given. Some numerical…
An origami (also known as square-tiled surface) is a Riemann surface covering a torus with at most one branch point. Lifting two generators of the fundamental group of the punctured torus decomposes the surface into finitely many unit…
We generalize problems in Wasan geometry which involve no folded figures but are related to Haga's fold in origami. Using the tangent circles appeared in those problems we give a parametric representation of the generalized Haga's fold…
We study operators that are products of two orthogonal projections. Our results complement some of the classical results of Crimmins and von Neumann. Particular emphasis has been given to projections associated with inner functions defined…
Enumerative algebraic geometry counts the solutions to certain geometric constraints. Numerical algebraic geometry determines these solutions for any given instance. This article illustrates how these two fields complement each other. Our…
The paper presents results for deriving closed-form analytic solutions of the evolution of inhomogeneities in a homogeneous spatially flat multicomponent cosmological model. Mathematical methods to derive computable forms of the…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
We prove the conjecture that two projective symplectic resolutions for a symplectic variety $W$ are related by Mukai's elementary transformations over $W$ in codimension 2 in the following cases: (i). nilpotent orbit closures in a classical…
In this note we give geometric formulations and proofs of three results of S. Morita. These results relate certain two dimensional cohomology classes of various moduli spaces of curves. We also give a geometric interpretation of a fourth…
The resolution of a decades-old open problem is described: polygonal chains cannot lock in the plane.
This article shows how to find the solution of an arbitrary quintic equation by performing two simultaneous folds on a sheet of paper. The folds achieve specific incidences between a set of points and lines that are determined by the…
Finite projective geometry underlies the structure of the 35 square patterns in R. T. Curtis's Miracle Octad Generator, and also explains the surprising symmetry properties of some simple graphic designs.
Plots of quadratic residues display some features that are analyzed mathematically.
We prove several hardness results on folding origami crease patterns. Flat-folding finite crease patterns is fixed-parameter tractable in the ply of the folded pattern (how many layers overlap at any point) and the treewidth of an…
We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…