Overview

In this project, you will implement a content-aware image resizing algorithm. By the end students will be able to:

  • Solve a real-world graph problem via reduction.
  • Represent problem solutions as states in a graph.
  • Apply graph augmentation as a strategy for solving a new class of graph problems

Getting the Assignment

Follow the instructions from the Deques assignment to add your partners into your team and pull the assignment from the public skeleton.

Like previous projects, if IntelliJ doesn’t react to the new folder for whatever reason, refresh Gradle manually through the Gradle tool window (on the right by default):

Gradle Refresh

Subpages

  1. Background - Familiarize yourself with Seam Carving and the assignment.
  2. Shortest Path Finder - Implement Dijkstra’s Algorithm to find the shortest path.
  3. Seam Finding - Implement the logic behind seam carving using two different techniques.