MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "On the cut polyhedron." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 25 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • On the Cut Polyhedron  
  • by Michele Conforti, Giovanni Rinaldi, Laurence Wolsey, Let G (v — 2000
  • …On the Cut Polyhedron # Michele Conforti + Giovanni Rinaldi # Laurence Wolsey January 27, 2000…
  • Cited by 1 (0 self) – Add To MetaCart
  • CUTTING CORNERS Shmuel Onn  
  • by Bernd Sturmfe Ls, Shmuel Onn, Bernd Sturmfels — 1999 — Advances in Applied Mathematics
  • … is the corner cut polyhedron, which we define as follows: P d n := conv \Phi 1 + \Delta \Delta \Delta…
  • Add To MetaCart
  • Volume queries in polyhedra  
  • by John Iacono, Stefan Langerman — 2000 — Proc. Japan Conf. Discrete Comput. Geom., 156–159, 2000. Lecture Notes Comput. Sci. 2098
  • … for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron…
  • Cited by 3 (3 self) – Add To MetaCart
  • Volume Queries in Polyhedra  
  • by John Iacono And, John Iacono, Stefan Langerman — Proc. Japan Conf. Discrete Comput. Geom., 156–159, 2000. Lecture Notes Comput. Sci. 2098
  • … for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron…
  • Add To MetaCart
  • Unfolding Some Classes of Orthogonal Polyhedra  
  • by Therese Biedl, Erik Demaine, Martin Demaine, Anna Lubiw, Mark Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides — 1998
  • … Introduction An unfolding of a polyhedron is a cutting of the polyhedron's surface so that the surface can…
  • Cited by 33 (10 self) – Add To MetaCart
  • Ununfoldable polyhedra with convex faces  
  • by Marshall Bern, Erik D. Demaine, David Eppstein, Eric Kuo, Andrea Mantler, Jack Snoeyink — 2002 — COMPUT. GEOM. THEORY APPL
  • … by cutting along edges. We further show that such a polyhedron can indeed be unfolded if cuts are allowed…
  • Cited by 18 (5 self) – Add To MetaCart
  • Unfolding Polyhedral Bands  
  • by Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried Toussaint
  • … not contain any vertices of the polyhedron. An unfolding of a given band is obtained by cutting along exactly…
  • Cited by 4 (1 self) – Add To MetaCart
  • CUTTING CORNERS  
  • by Shmuel Onn, Bernd Sturmfels — 1999 — ADVANCES IN APPLIED MATHEMATICS
  • … is the corner cut polyhedron, which we define as follows: P d n := conv \Phi 1 + \Delta \Delta \Delta…
  • Cited by 6 (3 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB