Rendering Videos as Animated Decorative Mosaics
Progress Report 2
March 18, 2004
Kaleigh Smith

Recall the problem

Without considering the time dimension, we need to pack each container.

1. Implement a framework for the problem as defined in previous progress report.

I've implemented the basic classes required for this project in C++ and have named the application Animosaic.

• Representation of containers, tiles, tile shapes.
• Use Computational Geometry Algorithms Library (CGAL) for represent geometric objects and use their basic algorithms that work upon these objects.

2. Container Packing with Generalized Centroidal Voronoi Diagrams (CVD)

We would like to determine the generalized voronoi diagram so that the generating sites can be polygonal shapes instead of points. We would also like to constrain the shape of the diagram space to match the shape of the container that we are trying to pack.

A) Discretized Graphics Hardware Approach, Hoff

Kenneth E. Hoff III, Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware. Hoff Voronoi.

B) Voronoi Diagrams of Points, Segments and Arcs in 2D, Held

Martin Held has implemented the VRONI application in C that computes Voronoi diagrams of points and line segments. Martin Held, VRONI.

I have incorporated the Vroni code into the Animosaic application and now able to experiment with container packings resulting from generalized Voronoi diagrams.

I will also consider that this is not the best approach and that I should perhaps use Hoff's discretized algorithm.

Plan: CODE CODE CODE

I've spent the past several weeks working over a severe learning curve and now feel that I have most of the tools I need to implement the project.