Related papers: Folding a 3D Euclidean space
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
We introduce an elementary transformation called flips on tilings by squares and triangles and conjecture that it connects any two tilings of the same region of the Euclidean plane.
We use functions of a bicomplex variable to unify the existing constructions of harmonic morphisms from a 3-dimensional Euclidean or pseudo-Euclidean space to a Riemannian or Lorentzian surface. This is done by using the notion of…
Folding a sheet of paper along a curve can lead to structures seen in decorative art and utilitarian packing boxes. Here we present a theory for the simplest such structure: an annular circular strip that is folded along a central circular…
We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…
3D data is a valuable asset the computer vision filed as it provides rich information about the full geometry of sensed objects and scenes. Recently, with the availability of both large 3D datasets and computational power, it is today…
In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…
This paper investigates the relationship between a system of differential equations and the underlying geometry associated with it. The geometry of a surface determines shortest paths, or geodesics connecting nearby points, which are…
How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…
Geometric algebra is an optimal frame work for calculating with vectors. The geometric algebra of a space includes elements that represent all the its subspaces (lines, planes, volumes, ...). Conformal geometric algebra expands this…
The geometric, topological, and symplectic properties of moduli spaces (spaces of configurations modulo rotations and translations) of polygonal linkages have been studied by Kapovich, Millson, and Kamiyama, et. al. One can form a polygonal…
Here we explore the geometry of the osculating spaces to projective varieties of arbitrary dimension. In particular, we classify varieties having very degenerate higher order osculating spaces and we determine mild conditions for the…
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The…
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…
The conditions for superintegrable systems in two-dimensional Euclidean space admitting separation of variables in an orthogonal coordinate system and a functionally independent third-order integral are studied. It is shown that only…
In this expository paper we give an elementary, hands-on computation of the homology of the little disks operad, showing that the homology of a $d-fold loop space is a Poisson algebra. One aim is to familiarize a greater audience with…
Many iterative methods in applied mathematics can be thought of as fixed-point iterations, and such algorithms are usually analyzed analytically, with inequalities. In this paper, we present a geometric approach to analyzing contractive and…
Boolean operations of geometric models is an essential issue in computational geometry. In this paper, we develop a simple and robust approach to perform Boolean operations on closed and open triangulated surfaces. Our method mainly has two…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
We contribute a new algebraic method for computing the orthogonal projections of a point onto a rational algebraic surface embedded in the three dimensional projective space. This problem is first turned into the computation of the finite…