Name
Abstract | ||
|---|---|---|
We extend the notion of a star unfolding to be based on a simple
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, planar polygon:
shortest paths from all vertices of P to Q are cut, and all but one segment of
Q is cut. |
Year | Venue | Keywords |
|---|---|---|
2008 | Clinical Orthopaedics and Related Research | shortest path,computational geometry |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Polygon,Vertex (geometry),Polyhedron,Regular polygon,Convex polytope,Planar,Mathematics,A* search algorithm | Journal | abs/0812.2 |
Citations | PageRank | References |
1 | 0.37 | 4 |
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 |