Folding Every Point on a Polygon Boundary to a Point
We consider a problem in computational origami. Given a piece of paper as a convex polygon <i>P</i> and a point <i>f</i> located within, we fold every point on a boundary of <i>P</i> to <i>f</i> and compute a region that is safe from folding, i.e., the region with no creases. This problem is an exte...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
MDPI AG
2023-05-01
|
| Colección: | Algorithms |
| Materias: | |
| Acceso en línea: | https://www.mdpi.com/1999-4893/16/6/281 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|