Programming Assignment 6: Seam Carving


/* *****************************************************************************
 *  Describe concisely your algorithm to find a horizontal (or vertical)
 *  seam.
 **************************************************************************** */



/* *****************************************************************************
 *  Describe what makes an image suitable to the seam-carving approach
 *  (in terms of preserving the content and structure of the original
 *  image, without introducing visual artifacts). Describe an image that
 *  would not work well.
 **************************************************************************** */



/* *****************************************************************************
 *  NOTE: This question is optional and worth 1 point of extra credit!!!
 *
 *  The removeHorizontalSeam() method you implemented probably takes O(WH) time,
 *  but could it be efficient? (W is the width of the current picture,
 *  and H the height).
 
 *  For this particular question, suppose you only want to implement the
 *  SeamCarver() constructor, as well as the picture() and
 *  removeHorizontalSeam() methods, so ignore the other methods you
 *  implemented in the assignment. Can you implement them in such a way that
 *  SeamCarver() and Picture() take O(WH) time, but removeHorizontalSeam()
 *  takes time that is asymptotically less than O(WH) (so O(W + H) or
 *  O(WlogH + HlogW) would both be allowed)?
 *
 *  Describe your algorithm and any data structures you use and state the
 *  runtime of removeHorizontalSeam(). You don't have to write any code.
 **************************************************************************** */




/* *****************************************************************************
 *  List any other comments here. Feel free to provide any feedback   
 *  on how much you learned from doing the assignment, and whether    
 *  you enjoyed doing it.                                             
 **************************************************************************** */