Flat 2-Foldings of Convex Polygons
A folding of a simple polygon into a convex polyhedron is accomplished by glueing portions of the perimeter of the polygon together to form a polyhedron. A polygon Q is a flat n -folding of a polygon P if P can be folded to exactly cover the surface of Qn times, with no part of the surface of P left...
Saved in:
Main Authors: | Akiyama, Jin, Hirata, Koichi, Ruiz, Mari-Jo P, Urrutia, Jorge |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2005
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/mathematics-faculty-pubs/81 https://link.springer.com/chapter/10.1007%2F978-3-540-30540-8_2 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
On controlling the parameter in the logarithmic barrier term for convex programming problems
by: Kortanek, K.O., et al.
Published: (2014) -
Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming
by: LI LU
Published: (2011) -
Limit theorems for the number of maxima in random samples from planar regions
by: Bai, Z.-D., et al.
Published: (2014) -
On curves of constant width
by: Dimaunahan, Doris, et al.
Published: (1993) -
Local polynomial convexity of union of two graphs with CR isolated singularities
by: Kieu, Phuong Chi
Published: (2017)