skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.
Attention:The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 7:00 AM ET to 7:30 AM ET on Friday, April 24 due to maintenance. We apologize for the inconvenience.


Title: Folding points to a point and lines to a line
We introduce basic, but heretofore generally unexplored, problems in computational origami that are similar in style to classic problems from discrete and computational geometry. We consider the problems of folding each corner of a polygon P to a point p and folding each edge of a polygon P onto a line segment L that connects two boundary points of P and compute the number of edges of the polygon containing p or L limited by crease lines and boundary edges.  more » « less
Award ID(s):
1906202 2428771
PAR ID:
10285207
Author(s) / Creator(s):
; ; ; ;
Editor(s):
He, Meng; Sheehy, Don
Date Published:
Journal Name:
Proceedings of the 33rd Canadian Conference on Computational Geometry (CCCG 2021)
Page Range / eLocation ID:
271-278
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Protein folding in the cell is mediated by an extensive network of >1,000 chaperones, quality control factors, and trafficking mechanisms collectively termed the proteostasis network. While the components and organization of this network are generally well established, our understanding of how protein-folding problems are identified, how the network components integrate to successfully address challenges, and what types of biophysical issues each proteostasis network component is capable of addressing remains immature. We describe a chemical biology–informed framework for studying cellular proteostasis that relies on selection of interesting protein-folding problems and precise researcher control of proteostasis network composition and activities. By combining these methods with multifaceted strategies to monitor protein folding, degradation, trafficking, and aggregation in cells, researchers continue to rapidly generate new insights into cellular proteostasis. 
    more » « less
  2. We consider an unconstrained tangential Dirichlet boundary control problem for the Stokes equations with an $ L^2 $ penalty on the boundary control.  The contribution of this paper is twofold.  First, we obtain well-posedness and regularity results for the tangential Dirichlet control problem on a convex polygonal domain.  The analysis contains new features not found in similar Dirichlet control problems for the Poisson equation; an interesting result is that the optimal control has higher local regularity on the individual edges of the domain compared to the global regularity on the entire boundary.  Second, we propose and analyze a hybridizable discontinuous Galerkin (HDG) method to approximate the solution.  For convex polygonal domains, our theoretical convergence rate for the control is optimal with respect to the global regularity on the entire boundary.  We present numerical experiments to demonstrate the performance of the HDG method. 
    more » « less
  3. Given graph G = (V, E) with vertex set V and edge set E, the max k-cut problem seeks to partition the vertex set V into at most k subsets that maximize the weight (number) of edges with endpoints in different parts. This paper proposes a graph folding procedure (i.e., a procedure that reduces the number of vertices and edges of graph G) for the weighted max k-cut problem that may help reduce the problem’s dimensionality. While our theoretical results hold for any k ≥ 2, our computational results show the effectiveness of the proposed preprocess only for k = 2 and on two sets of instances. Furthermore, we observe that the preprocess improves the performance of a MIP solver on a set of large-scale instances of the max cut problem. 
    more » « less
  4. A finite element based computational scheme is developed and employed to assess a duality based variational approach to the solution of the linear heat and transport PDE in one space dimension and time, and the nonlinear system of ODEs of Euler for the rotation of a rigid body about a fixed point. The formulation turns initial-(boundary) value problems into degenerate elliptic boundary value problems in (space)-time domains representing the Euler-Lagrange equations of suitably designed dual functionals in each of the above problems. We demonstrate reasonable success in approximating solutions of this range of parabolic, hyperbolic, and ODE primal problems, which includes energy dissipation as well as conservation, by a unified dual strategy lending itself to a variational formulation. The scheme naturally associates a family of dual solutions to a unique primal solution; such ‘gauge invariance’ is demonstrated in our computed solutions of the heat and transport equations, including the case of a transient dual solution corresponding to a steady primal solution of the heat equation. Primal evolution problems with causality are shown to be correctly approximated by noncausal dual problems. 
    more » « less
  5. Abstract Immersed boundary methods are high-order accurate computational tools used to model geometrically complex problems in computational mechanics. While traditional finite element methods require the construction of high-quality boundary-fitted meshes, immersed boundary methods instead embed the computational domain in a structured background grid. Interpolation-based immersed boundary methods augment existing finite element software to non-invasively implement immersed boundary capabilities through extraction. Extraction interpolates the structured background basis as a linear combination of Lagrange polynomials defined on a foreground mesh, creating an interpolated basis that can be easily integrated by existing methods. This work extends the interpolation-based immersed isogeometric method to multi-material and multi-physics problems. Beginning from level-set descriptions of domain geometries, Heaviside enrichment is implemented to accommodate discontinuities in state variable fields across material interfaces. Adaptive refinement with truncated hierarchically refined B-splines (THB-splines) is used to both improve interface geometry representations and to resolve large solution gradients near interfaces. Multi-physics problems typically involve coupled fields where each field has unique discretization requirements. This work presents a novel discretization method for coupled problems through the application of extraction, using a single foreground mesh for all fields. Numerical examples illustrate optimal convergence rates for this method in both 2D and 3D, for partial differential equations representing heat conduction, linear elasticity, and a coupled thermo-mechanical problem. The utility of this method is demonstrated through image-based analysis of a composite sample, where in addition to circumventing typical meshing difficulties, this method reduces the required degrees of freedom when compared to classical boundary-fitted finite element methods. 
    more » « less