English
Related papers

Related papers: Universal Hinge Patterns for Folding Strips Effici…

200 papers

Off-the-shelf fused filament fabrication 3D printers are widely accessible and convenient, yet they exhibit quality loss at high speeds due to dynamic mis-synchronization between printhead motion and material extrusion systems, notably…

Systems and Control · Electrical Eng. & Systems 2026-01-01 Yufan Lin , Xavier Guidetti , Yannick Nagel , Efe C. Balta , John Lygeros

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

Computational Geometry · Computer Science 2024-12-20 Erik D. Demaine , Martin L. Demaine , Markus Hecher , Rebecca Lin , Victor H. Luo , Chie Nara

This study starts from the counter-intuitive question of how we can render a conventional stiff, non-stretchable and even brittle material conformable so that it can fully wrap around a curved surface, such as a sphere, without failure.…

Computational Geometry · Computer Science 2018-12-31 Yu-Ki Lee , Zhonghua Xi , Young-Joo Lee , Yun-Hyeong Kim , Yue Hao , Young-Chang Joo , Changsoon Kim , Jyh-Ming Lien , In-Suk Choi

We introduce Patchwork, a new general-purpose shape representation capable of modeling 2D and 3D geometry with a small number of parameters. Patchwork is grounded in a rigorous mathematical framework, providing provable complexity bounds…

Graphics · Computer Science 2026-05-19 Ruichen Zheng , Biao Zhang , Michael Birsak , Mikhail Skopenkov , Peter Wonka

Until recently, the simplest known flexible polyhedron was Steffen's polyhedron on nine vertices. However, in 2024, an embedded flexible polyhedron on eight vertices was announced. It attains the known lower bound for the number of…

Metric Geometry · Mathematics 2025-10-09 Elvar Atlason

The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…

Combinatorics · Mathematics 2025-04-08 Himanshu Chandrakar , Anurag Singh

A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and…

Computational Geometry · Computer Science 2008-08-06 Evan VanderZee , Anil N. Hirani , Damrong Guoy

Each element in tensioned structural networks -- such as tensegrity, architectural fabrics, or medical braces/meshes -- requires a specific tension level to achieve and maintain the desired shape, stability, and compliance. These structures…

Graphics · Computer Science 2025-09-09 Thijs Masmeijer , Caleb Swain , Jeff Hill , Ed Habtour

A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…

Metric Geometry · Mathematics 2007-05-23 Chaim Goodman-Strauss , John M Sullivan

Topological magnetism, characterized by topologically protected spin textures, offers rich physics and transformative prospects for spintronics. However, its stabilization typically demands external magnetic fields, preventing…

Materials Science · Physics 2026-03-06 Zhonglin He , Kaiying Dou , Wenhui Du , Ying Dai , Evgeny Y. Tsymbal , Yandong Ma

We give an explicit and effective construction for rhombus cut-and-project tilings with global n-fold rotational symmetry for any n. This construction is based on the dualization of regular n-fold multigrids. The main point is to prove the…

Discrete Mathematics · Computer Science 2024-09-25 Victor H. Lutfalla

Graphical data arises naturally in several modern applications, including but not limited to internet graphs, social networks, genomics and proteomics. The typically large size of graphical data argues for the importance of designing…

Information Theory · Computer Science 2021-07-20 Payam Delgosha , Venkat Anantharam

There are many methods for projecting spherical maps onto the plane. Interactive versions of these projections allow the user to centre the region of interest. However, the effects of such interaction have not previously been evaluated. In…

Human-Computer Interaction · Computer Science 2022-02-23 Kun-Ting Chen , Tim Dwyer , Yalong Yang , Benjamin Bach , Kim Marriott

For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…

Metric Geometry · Mathematics 2018-05-01 Yohji Akama , Bobo Hua , Yanhui Su

By means of constructing a new edge-bending algorithm, we prove that every locally polyhedral tiling of $\mathbb{R}^3$ can be completely softened. A weaker form of this statement, for polyhedral space tilings, was conjectured by Domokos,…

Metric Geometry · Mathematics 2026-04-21 Gergely Ambrus , Dorottya Dancsó

In this paper, we discuss the mechanics and planning algorithms to slide an object on a horizontal planar surface via frictional patch contact made with its top surface. Here, we propose an asymmetric dual limit surface model to determine…

Robotics · Computer Science 2023-05-24 Xili Yi , Nima Fazeli

Any two polygons of equal area can be partitioned into congruent sets of polygonal pieces, and in many cases one can connect the pieces by flexible hinges while still allowing the connected set to form both polygons. However it is open…

Computational Geometry · Computer Science 2007-05-23 David Eppstein

An orthotube consists of orthogonal boxes (e.g., unit cubes) glued face-to-face to form a path. In 1998, Biedl et al. showed that every orthotube has a grid unfolding: a cutting along edges of the boxes so that the surface unfolds into a…

Computational Geometry · Computer Science 2023-05-02 Erik D. Demaine , Kritkorn Karntikoon

The generalized winding number is an essential part of the geometry processing toolkit, allowing to quantify how much a given point is inside a surface, even when the surface has boundaries and noise. We propose a new universal method to…

Graphics · Computer Science 2025-09-16 Cedric Martens , Mikhail Bessmeltsev

Matrix-free finite element implementations of massively parallel geometric multigrid save memory and are often significantly faster than implementations using classical sparse matrix techniques. They are especially well suited for…

Numerical Analysis · Mathematics 2016-08-24 Simon Bauer , Marcus Mohr , Ulrich Rüde , Jens Weismüller , Markus Wittmann , Barbara Wohlmuth
‹ Prev 1 4 5 6 7 8 10 Next ›