Home | Bookmarks | Papers | Blog |

A Practical Approach for Computing the Diameter of a Point-Set

This is the implementation of the algorithm described here.

The code provided below can do the following things:

- Compute the
**exact**diameter of a point-set in 3d. Seems to be linear time for most ``real'' inputs. Can be quadratic in the worst case. - Approximate the diameter of a point-set up to a prespecified approximation parameter. Running-time depends on the parameter, and for reasonable value of this parameter it is linear.
- Compute a tight-fitting bonding-box that contains a given input point-set. The bounding box is arbitrarly oriented. Based on the paper and code of [Barequet and Har-Peled, 99].

- Source code:

libgdiam-1.0.3.tar.gz (3/6/18).

Old version: libgdiam-1.0.2.tar.gz (08/19/16).

libgdiam-1.0.1.tar.gz (08/11/2013). -
#### Building instructions on Linux:

~/$ tar -xzf libgdiam-ver.tar.gz ~/$ cd libgdiam/ ~/libgdiam$ mkdir build ~/libgdiam$ cd build/ ~/libgdiam/build$ cmake .. ~/libgdiam/build$ make test

Last modified: Fri Feb 14 09:13:40 CST 2014