\begin{frame}
\frametitle{Team}
\begin{center}
-Akshay Ganesh\\
-Clinton Charles\\
+Akshay Ganesh (M.Sc DDS)\\
+Clinton Charles (M.Sc DDS)\\
Janos Piddubnij (M.Sc. Data Science)\\
-Kalyan Keesara\\
+Kalyan Keesara (M.Sc DDS)\\
Luca Koczula (M.Sc. Industrial Engineering)\\
Moritz Dederichs (M.Sc. Computer Science)\\
Tobias Wagner (M.Sc. Industrial Engineering)\\
\begin{figure}[b]
\centering
- \includegraphics[width=0.7\linewidth]{slice_illustration}
+ \includegraphics[width=0.2\linewidth]{child_slice}
+ \includegraphics[width=0.2\linewidth]{parent_slice}
\caption[EPfig]{The slices are added till the container is complete.}
\label{fig:sliceillustration}
\end{figure}
\begin{frame}
\frametitle{Peak Filling Slice Push (PFSP), Steps}
- The algorithm has 2 steps
+ The heuristic has 2 steps
\begin{itemize}
\item Placing item in the slice
\item Push
\begin{figure}[b]
\centering
- \includegraphics[width=0.45\linewidth]{push_illustration}
+ \includegraphics[scale=0.23]{push_1}
+ \hspace*{3cm}\includegraphics[scale=0.23]{push_2}
\caption[PUSHfig]{Push step reduces the wasted space.}
\label{fig:pushillustration}
\end{figure}
\begin{frame}[fragile]
\frametitle{Peak Filling Slice Push (PFSP), Pseudocode and Run Time}
-\begin{minipage}{0.45\textwidth}
+Pseudocode:\\
+While (Container.FULL = False) \{\\
+Stack.Clear()\\
+Temp Box = GetFirstAvailableBox(Box Array)\\
+Slice = CreateSlice(Temp Box)\\
+If(Slice - Null) Container.FUL - True\\
+Rectangle = GetRectangle(Slice)
+Stack.Push (Rectangle)\\
+Packed Boxes - PeakFilling(Box Array, Container, Slice, Stack)\\
-\end{minipage}
-
-
-
-
-
-
-
-The runtime complexity is $O(|U|^3)$
+\}\\
+
+Runtime:
+
+The runtime complexity is $O(|N|^3)$