Data sets and Tools
Introduction
The aim of this web page is to provide data sets and elementary codes
to researchers working on discrete geometry. The idea is to make it
easy for the community to try our own algorithms on the same image
examples as other researchers, as well as to try the algorithms of
other researchers. Obviously, feel free to send an e-mail to authors of these web pages
(see below) if you have comments.
Data sets
Note : all the materials present in these web pages are
copyright free.
Submission process
By now, no automatic submission process have been set
up. If you want
to submit something, send a mail to webmasters (see below) that
contains an URL to your materials. Please do not
send
directly your data by e-mail.
Tools on the web
- Visualization tools
- QVox: A 3d
volumetric data visualizer written by Sébastien Fourey (see the
TC18 code web page).
- Geomview: an simple
interactive 3D viewing program for Unix. Major advantages are : easy to
use input format (close to VRML), postscript snapshots, export to VRML.
See the 3-D data code web page for snapshots.
- VRML: web based
visualization tool.
- Computational Geometry tools
- qhull
: Qhull computes convex hulls, Delaunay triangulations, halfspace
intersections about a point, Voronoi diagrams, furthest-site Delaunay
triangulations, and furthest-site Voronoi diagrams. It runs in 2-d,
3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm
for computing the convex hull. Qhull handles roundoff errors from
floating point arithmetic. It computes volumes, surface areas, and
approximations to the convex hull. Export to Geomview
avaliable.
- Computational Geometry
center: useful links and tools about computational geometry.