Listed on this page are a number of projects and/or packages that the
developers of CGAL are working on or have plans to work on some time in the
near future. If you have an interest in seeing any of these projects included
in the library, please let us know.
-
Using Cmake as the build system
Fernando Cacciola at GeometryFactory is working on switching
the build system to Cmake instead of
CGAL's own scripts.
-
Benchmark
Eric Berberich, Andreas Meyer from MPI
Saarbrücken, and Efi Fogel from Tel Aviv
University are working on a package that evaluates the
status of code. It will be used to create programs that
measure performance, known as benchmarks, and other various
tests, execute them, and analyze their results.
-
Parallel algorithms
Sylvain Pion at Inria Sophia Antipolis coordinates an effort
to introduce parallelism in some CGAL algorithms like triangulations.
-
Exact Filtered Geometric Constructions
Sylvain Pion from INRIA is working with Andreas Fabri from
GeometryFactory on improving the speed of exact geometric
constructions (like circumcenters, intersections) in the whole
2D-3D CGAL kernels.
-
3D Triangulations extensions
Manuel Caroli and Monique Teillaud from
Inria Sophia Antipolis are working on the extension
of 3D triangulations to other geometries (sphere, torus...).
This will allow in particular the computation of 3D periodic
meshes.
-
3D Triangulations and Meshes
Mariette Yvinec from Inria Sophia Antipolis is coordinating
the development of conformal 3D triangulations, constrained
triangulations in 3D, surface meshes and 3D meshes.
-
k-Order Voronoi Diagrams
Thanh-Trung Nguyen is working at Inria Sophia Antipolis on a
k-order Voronoi diagrams package.
-
Arrangements on Surfaces
Ron Wein, Efi Fogel, Ophir Setter, Shlomo Golubev, and Dan
Halperin from Tel Aviv University are working on a
package that constructs, maintains, modifies, traverses,
queries, and presents arrangements embedded on parametric
surfaces, e.g., arrangements embedded on a plane, on a sphere,
on a torus, etc.. This packages will replace the Arrangement_2
package.
-
3D Spherical Kernel
Monique Teillaud from Inria Sophia Antipolis is
coordinating the development of a kernel for spheres,
circles and circular arcs in 3D.
-
3D Arrangements of Spheres
Daniel Russel from University of California
and Monique Teillaud from Inria Sophia Antipolis
are working on 3D Arrangements of spheres.
-
Cubical Gaussian Maps
Efi Fogel from Tel Aviv University is working on
a package that represents Gaussinal maps mapped onto a unit
cube (an axes parallel cube centered at the origin whose edges
are of length two). It will be used to represents 3D convex
polyhedra and answer proximity queries on such polyhedra.
-
Parametric Search
Rene van Oostrum and Remco Veltkamp
from Utrecht University are working on an extension
package that will provide a framework for implementing algorithms in
the class of 'parametric search' optimization algorithms. Parametric
search is often considered unpractical, but this package proves
otherwise. The framework allows users to provide their own decision
problems and sorting algorithms; the package provides
a Quicksort-based solution and, as an example problem, code
to compute the Fréchet distance between polygonal curves.
-
Polygonal Approximation
Ovidiu Grigore and Remco Veltkamp
from Utrecht University are working on an extension
package that will provide implementations of a number of algorithms
for approximating polygonal curves, including a generic iterative
split procudure (with a specialization into the Douglas-Peucker
algorithm) and a generic dynamic programming algorithm for optimal
approximations.
-
2D Generic Algebraic Kernel and Generic Points and Arcs
Pavel Emeliyanenko and Eric Berberich from MPI are working on
a generic algebraic kernel providing curve-analysis and curve-pair
analysis. This layer will support the generic implementation of points and (curved)
arcs in 2D - an intermediate step towards a fully-fledged Curved_kernel_2.