Snake Terrains

Below are several of the polyhedral terrains we used to test correctness. Each is a snakelike channel surrounded by high walls. The central shortest paths, snaking down the channel, are known, and that our program finds them is evidence that it is working correctly.
All times were measured on on an Linux PC with a Pentium III 600 MHz processor and 256MB RAM.

All images Copyright (C) 2000 Biliana Kaneva and Joseph O'Rourke


Two views of a snake terrain of 7 "turns" (n vertices, F faces).

Statistics: n = 200; F = 394; time = 7 sec; memory = 5.538 MB

A closeup of a snake terrain of 19 "turns" (n vertices, F faces).

Statistics: n = 548; F = 1090; time = 70 sec; memory = 22.806 MB

Two views of a snake terrain of 31 "turns" (n vertices, F faces).

Statistics: n = 896; F = 1786; time = 201 sec; memory = 42.313 MB


Research supported by NSF grant CCR-9731804.
Last Update: