𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Folding a surface to a polygon

✍ Scribed by H. R. Farran; E. El Kholy; S. A. Robertson

Publisher
Springer
Year
1996
Tongue
English
Weight
516 KB
Volume
63
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

✦ Synopsis

A concept of folding for compact connected surfaces, involving the partition of the surface into combinatorially identical n-sided topological polygons, is defined. The existence of such foldings for given n and given surfaces is explored, with definitive results for the sphere and the toms. We obtain necessary conditions for the existence of such foldings in all other cases.

📜 SIMILAR VOLUMES

Simplification of surface parametrizatio
Simplification of surface parametrizations—a lattice polygon approach
✍ Josef Schicho 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Given a convex lattice polygon, we compute a descending sequence of lattice polygons obtained by repeatedly passing to the convex hull of the interior lattice points. This process gives the idea for an algorithm that simplifies a given parametric surface by reparametrization.

A C2 polygonal surface patch
A C2 polygonal surface patch
✍ John A. Gregory; Jörg M. Hahn 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 420 KB
Implementation of a polygonal algorithm
Implementation of a polygonal algorithm for surface–surface intersections
✍ Utpal Roy; V.Ramana Dasari 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 710 KB

AbstractÐThis paper discussed the problem of ®nding intersections between surfaces. Surfaces are divided into planar sub-patches, typically triangles. Triangles of one surface are tested for intersection with triangles of the second surface, one by one. The triangles are ®rst projected on a horizont

On a Polygon Equality Problem
On a Polygon Equality Problem
✍ L Elsner; L Han; I Koltracht; M Neumann; M Zippin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 137 KB

Bernius and Blanchard of Bielefeld University in Germany have conjectured the following polygon inequality: for any two sets of vectors x , . . . , x and y , . . . , y 1 and subsequently use this characterization to complete the proof of the Bernius᎐Blanchard conjecture concerning the equality case