2 search results - page 1 / 1 » On the Fewest Nets Problem for Convex Polyhedra |
CCCG
2007
13 years 6 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
APN
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...