scientific article; zbMATH DE number 7779753
From MaRDI portal
Publication:6179337
DOI10.57717/cgt.v2i2.28arXiv2206.12989MaRDI QIDQ6179337
Publication date: 16 December 2023
Full work available at URL: https://arxiv.org/abs/2206.12989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of digital topology (68U03)
Cites Work
- Unnamed Item
- Continuous blooming of convex polyhedra
- Flattening single-vertex origami: The non-expansive case
- On the algebraic part of an alternating link
- A note on reconfiguring tree linkages: Trees can lock
- Interlocked open and closed linkages with few joints.
- Straightening polygonal arcs and convexifying polygonal cycles
- Spiral-like functions with respect to a boundary point
- Translation of Michael Sadowsky's paper ``An elementary proof for the existence of a developable Möbius band and the attribution of the geometric problem to a variational problem
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- When can a net fold to a polyhedron?
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- Rigid Origami Vertices: Conditions and Forcing Sets
- Minimal Locked Trees
- On the unfolding of simple closed curves
- Movement Problems for 2-Dimensional Linkages
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- An Optimal Algorithm for Finding the Kernel of a Polygon
- A combinatorial bound for linear programming and related problems
- Realization and Connectivity of the Graphs of Origami Flat Foldings
- Single-Vertex Origami and Spherical Expansive Motions
- Locked and unlocked polygonal chains in three dimensions
- Locked and unlocked chains of planar shapes
This page was built for publication:
