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.

• Motion Planning Benchmarks
• 2D & 3D Geometric Decomposition Benchmarks

Parasol Home | Research | People | General info | Seminars | Resources   Parasol Lab, 301 Harvey R. Bright Bldg, 3112 TAMU, College Station, TX 77843-3112  Contact Webmaster      Phone 979.458.0722     Fax 979.458.0718  Department of Computer Science | Dwight Look College of Engineering | Texas A&M University     Privacy statement: Computer Science Engineering TAMU