English
Related papers

Related papers: An Attack on Flexibility and Stoker's Problem

200 papers

Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…

Metric Geometry · Mathematics 2016-10-11 Egon Schulte , Asia Ivić Weiss

A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…

Computational Geometry · Computer Science 2026-01-28 Péter Salvi

We discuss how transformations in a three dimensional euclidean space can be described in terms of the Clifford algebra $\mathcal{C}\ell_{3,3}$ of the quadratic space $\mathbb{R}^{3,3}$. We show that this algebra describes in a unified way…

General Mathematics · Mathematics 2019-08-23 Jayme Vaz , Stephen Mann

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

Optimization and Control · Mathematics 2023-05-04 Daniel Dörfler

Let L be a simple Euclidean arrangement of n pseudolines. It is shown that if L has exactly one (>=5)=gon P, and k is the number of edges of P that are adjacent to an unbounded cell of the subarrangement of L induced by the pseudolines in…

Combinatorics · Mathematics 2010-08-30 Jesus Leaños , Mbe Koua Christophe Ndjatchi , Luis Manuel Rivera-Martinez

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss…

Combinatorics · Mathematics 2022-04-28 Signe Lundqvist , Klara Stokes , Lars-Daniel Öhman

A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…

Metric Geometry · Mathematics 2023-07-18 Michael Q. Rieck

We consider the rational linear relations between real numbers whose squared trigonometric functions have rational values, angles we call ``geodetic''. We construct a convenient basis for the vector space over Q generated by these angles.…

Mathematical Physics · Physics 2007-05-23 John H. Conway , Charles Radin , Lorenzo Sadun

We consider polyhedral versions of Kannan and Lipton's Orbit Problem (STOC '80 and JACM '86)---determining whether a target polyhedron V may be reached from a starting point x under repeated applications of a linear transformation A in an…

Computational Complexity · Computer Science 2014-10-14 Ventsislav Chonev , Joël Ouaknine , James Worrell

A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…

Combinatorics · Mathematics 2021-06-04 Christos A. Athanasiadis

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

Metric Geometry · Mathematics 2019-08-16 J. Richard Gott

Many algorithmic problems can be solved (almost) as efficiently in metric spaces of bounded doubling dimension as in Euclidean space. Unfortunately, the metric space defined by points in a simple polygon equipped with the geodesic distance…

Computational Geometry · Computer Science 2026-04-20 Mark de Berg , Prosenjit Bose , Leonidas Theocharous

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

Functional Analysis · Mathematics 2010-10-13 Maxim V. Balashov , Dušan Repovš

Given two compact n-dimensional manifolds in the smooth, piecewise linear or topological categories, basic results of B. Mazur and others give simple criteria for determining whether their products with Euclidean spaces of sufficiently…

Geometric Topology · Mathematics 2017-05-17 Sławomir Kwasik , Reinhard Schultz

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

Computational Geometry · Computer Science 2015-07-31 Muhibur Rasheed , Chandrajit Bajaj

We consider the vector space of globally differentiable piecewise polynomial functions defined on a three-dimensional polyhedral domain partitioned into tetrahedra. We prove new lower and upper bounds on the dimension of this space by…

Algebraic Geometry · Mathematics 2014-03-05 Bernard Mourrain , Nelly Villamizar

Starting with the unsolved "D\"urer's problem" of edge-unfolding a convex polyhedron to a net, we specialize and generalize (a) the types of cuts permitted, and (b) the polyhedra shapes, to highlight both advances established and which…

Computational Geometry · Computer Science 2019-08-21 Joseph O'Rourke

A conformal map from a Riemann surface to a Euclidean space of dimension greater than or equal to three is explained by using the Clifford algebra, in a similar fashion to quaternionic holomorphic geometry of surfaces in the Euclidean…

Differential Geometry · Mathematics 2019-08-16 Katsuhiro Moriya

We study the general rational trigonometry of a tetrahedron, based on quadrances, spreads and solid spreads, using vector products associated to an arbitrary symmetric bilinear form over a general field, not of characteristic two. This…

Metric Geometry · Mathematics 2021-08-17 Gennady A Notowidigdo , Norman J Wildberger