Anaheim, 23-25 July 2013.

Attend the technical talk about Anisotropic Mesh Generation by Jane Tournois

]]>Los Angeles, 7-9 August 2012.

It is the conference where “artists meet scientists”, but it is at the same time an event where engineers meet engineers.

]]>Sometimes software is mature enough to get distributed, so that others can reproduce results, check wether the algorithm works on their own real world data, and compare with another algorithm for the same problem, or another implementation of the same algorithm.

Only a small fraction of software gets developed with the ambition to produce “high quality” software.

GeometryFactory sponsors the SGP Software Award in order to encourage scientists to go the extra mile it takes to turn a research result into “high quality” software.

It takes an extra mile, as it means working on robustness so that the algorithm also works for degenerate or noisy input data, as it means cross-platform support, that is different compilers and third party software), as it means working on API design, as it means to write a documentation and test cases, as well as examples and tutorials, as it means dealing with users and bug reports, and reviewers in case the software is part of a library. It finally means a long term commitment as software needs maintenance.

All this is an effort we should not underestimate. We heavily profit from it as it allows to leverage on existing solutions when we work on new problems, inside as well as outside of the geometry processing community.

]]>Here comes my first code snippet

std::cout << "Hello World" << std::endl;

and let’s try something more involved

template <typename K> class Triangulation { typedef typename K::Point_3 Point; Triangulation() {} };]]>

Besides fixes to existing packages major features where added in the following packages.

This package implements linear cell complexes, objects in d-dimension with linear geometry. The combinatorial part of objects is described by a combinatorial map, representing all the cells of the object plus the incidence and adjacency relations between cells. Geometry is added to combinatorial maps simply by associating a point to each vertex of the map. This data structure can be seen as the generalization in dD of the `Polyhedron_3`

.

See here for a complete list of changes.

Laurent Rineau, PhD

Engineer at GeometryFactory http://www.geometryfactory.com/

Release Manager of the CGAL Project http://www.cgal.org/

Besides fixes to existing packages major features where added in the following packages.

This package provides a new combinatorial data structure allowing to describe any orientable subdivided object whatever its dimension.

The quickhull implementation of CGAL (CGAL::convex_hull_3) has been worked out to provide much better performances

A new geometry-traits class that handles rational arcs has been introduced. It replaced an old traits class, which handled the same family of curves, but it was less efficient.

See here for a complete list of changes.

Laurent Rineau, PhD

Engineer at GeometryFactory http://www.geometryfactory.com/

Release Manager of the CGAL Project http://www.cgal.org/

Vancouver, 8-11 August 2011. ]]>