Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Pak, Igor Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 2 of 2 reviews    
  Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
Miller E., Pak I. Discrete & Computational Geometry 39(1): 339-388, 2008.  Type: Article

This is a long, complex, and incredibly rich paper. It contains, in some sense, one main result: the source unfolding that unfolds the surface of a convex polyhedron P to a planar, nonoverlapping polygon ...
Apr 8 2010  
  Tile invariants: new horizons
Pak I. Theoretical Computer Science 303(2-3): 303-331, 2003.  Type: Article

The tiling problem can best be described by thinking of the problem of covering a checkerboard with dominoes. One can generalize the problem by allowing other shapes of the board, changing it to have infinite dimensions, allowing for h...
...
Feb 24 2004  

   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy