Name
Abstract | ||
|---|---|---|
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple (non-overlapping), planar polygon: cut along one shortest path from each vertex of P to Q, and cut all but one segment of Q. |
Year | DOI | Venue |
|---|---|---|
2010 | https://doi.org/10.1007/s00454-009-9223-x | Discrete & Computational Geometry |
Keywords | Field | DocType |
Unfolding,Star unfolding,Convex polyhedra,Quasigeodesics,Quasigeodesic loops,Shortest paths | Discrete mathematics,Polygon,Combinatorics,Shortest path problem,Vertex (geometry),Polyhedron,Regular polygon,Convex polytope,Planar,Mathematics | Journal |
Volume | Issue | ISSN |
44 | 1 | 0179-5376 |
Citations | PageRank | References |
9 | 1.29 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin-ichi Itoh | 1 | 47 | 10.17 |
| Joseph O'Rourke | 2 | 1636 | 439.71 |
| Costin Vîlcu | 3 | 20 | 4.68 |