1. Skip to navigation
  2. Skip to content
  3. Skip to sidebar

Gigapans

NEW! Print your gigapan now!
Go to page:

  1. A Gigapan made from the top of the UCD Physics building (with thanks to the Physics Department for their cooperation). We are testing our gigapixel setup for fieldwork (made a few mistakes on this run through), and wanted a great view to start with. The California coastal mountains are in the distance and many UC Davis...

    • Stats

      Favorites
      0
      Comments
      Snapshots
      Total Views
      224
      Explore Score
      37

      • Meta

        Size
        7.57 Gigapixels
        Added
        March 13, 2013
        Date Taken
        March 13, 2013
        Categories
         
        Tags

  2. *** Sparse image - please zoom in, or view in full screen mode in a dark room! *** This is a self-avoiding walk sampled from the uniform distribution via a new implementation of the pivot algorithm. The self-avoiding walk (SAW) is an extremely simple model: a SAW is a walk on the lattice such that no lattice vertex i...

  3. *** Sparse image - please zoom in, or view in full screen mode in a dark room! *** This is a self-avoiding walk sampled from the uniform distribution via a new implementation of the pivot algorithm. The self-avoiding walk (SAW) is an extremely simple model: a SAW is a walk on the lattice such that no lattice vertex i...

  4. *** Sparse image - please zoom in, or view in full screen mode in a dark room! *** This is a self-avoiding walk sampled from the uniform distribution via a new implementation of the pivot algorithm. The self-avoiding walk (SAW) is an extremely simple model: a SAW is a walk on the lattice such that no lattice vertex i...

  5. *** Sparse image - please zoom in, or view in full screen mode in a dark room! *** This is a self-avoiding walk sampled from the uniform distribution via a new implementation of the pivot algorithm. The self-avoiding walk (SAW) is an extremely simple model: a SAW is a walk on the lattice such that no lattice vertex i...

  6. This self-avoiding walk was generated via a new implementation of the pivot algorithm. The self-avoiding walk (SAW) is an extremely simple model: a SAW is a walk on the lattice such that no lattice vertex is visited twice. However, it exactly captures the essential physics of the behaviour of polymers in a good solven...

  7. This self-avoiding walk was generated via a new implementation of the pivot algorithm. The self-avoiding walk (SAW) is an extremely simple model: a SAW is a walk on the lattice such that no lattice vertex is visited twice. However, it exactly captures the essential physics of the behaviour of polymers in a good solven...

  8. This self-avoiding walk was generated via a new implementation of the pivot algorithm. The self-avoiding walk (SAW) is an extremely simple model: a SAW is a walk on the lattice such that no lattice vertex is visited twice. However, it exactly captures the essential physics of the behaviour of polymers in a good solven...

  9. This is a self-avoiding walk sampled from the uniform distribution via a new implementation of the pivot algorithm. The self-avoiding walk (SAW) is an extremely simple model: a SAW is a walk on the lattice such that no lattice vertex is visited twice. However, it exactly captures the essential physics of the behaviour...

  10. This is a self-avoiding walk sampled from the uniform distribution via a new implementation of the pivot algorithm. The self-avoiding walk (SAW) is an extremely simple model: a SAW is a walk on the lattice such that no lattice vertex is visited twice. However, it exactly captures the essential physics of the behaviour...

Go to page: