Data sets and Code section
IntroductionThe 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. Several sections are presented in this web page:
- Data sets: 2D and 3D images (binary, grayscale,...)
- Demos: online demonstrators of DG algorithms and applications.
- Code Repository: simple codes from researchers to researchers.
- Algorithm comparisons: in order to make comparisons easiest.
- Tools avaliable on the web: links to useful tools.
- Submit your own data/code: how to submit a code ? How to submit the results of your own algorithm on our data sets ?...
Note : all the materials present in these web pages are copyright free.
DemosLink to demos
Feel free to contact us if you have a new demo to submit.
CodePlease fill free to submit your own code. In order to make a better use of your programs, a good way is to organize it in a K.I.S.S. way (Keep It Simple and Stupid). The idea is to propose simple codes, easy to compile and to easy to reuse.
Go to the Code web page.
A long term purpose of the TC18 web page was to encourage collaborations between researchers in the Discrete Geometry field. We are pleased to announce a new structure on the TC18 webpages: the TC18 challenges. The idea is to provide benchmarks and references to obtain comparative evaluations of classical problems in Discrete Geometry.
To create a new challenge, contact the TC18 chairs.
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.
Submission processBy 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.