Home research People General Info Seminars Resources Intranet
| Algorithms & Applcations Group | Home | Research | Publications | People | Resources | News

Algorithms & Applications Group
Benchmarks

Benchmarks are a valuable resource for comparing the performance of different algorithms. Unfortunately, good benchmark suites do not exist for many of the problems studied by our group.

To address this issue, we are attempting to start a collection of benchmark problems for areas such as motion planning and decomposition of two-dimensional and three-dimensional polyhedral models. As such, these benchmark problems are available for public, non-commercial use provided that appropriate reference is made to the source/creator of the problem. Also, if you have any problems that you could contribute to this effort, please let us know and we will be happy to post them here.

alpha-puzzle

Alpha Puzzle

flange-problem

Flange Problem

pentomino-puzzle

Pentomino Puzzle

box-folding-problem

Box Folding Problem

periscope-folding-problem

Periscope Folding Problem

bug-trap

Bug-Trap

hedgehog

Hedgehog

serial-walls

Serial Walls

bright-building

Bright Building

l-tuunel

L Tunnel

s-tunnel

S Tunnel

z-tunnel

Z Tunnel

zigzag

Zig-Zag

maze

Maze

heterogeneous

Heterogeneous

simpleobstacles

Simple Obstacles

nazca-monkey

Nazca Monkey

nazca-heron

Nazca Heron

fish-eye

Fish Eye

neurons

Neurons