Exploitable results
CGAL is a software library of algorithms and data structures that solve problems in computational geometry.
The key features of the library are:
- It is a generic library of adaptable and reusable code.
- It allows the use of robust exact arithmetic as well as fast floating point arithmetic.
- It is implemented in C++ and follows recent trends in software design.
The library contains a kernel, a basic library and a support library. The kernel consists of basic primitives such as point, line, vector, etc, as well as transformations, intersection and distance computations. The basic library consists of a growing number of standard data structures and algorithms that solve computational geometry problems, for example convex hull, triangulation, polyhedron, Boolean operations, smallest enclosing circle, kD-tree. The support library is for I/O, visualization tools, etc.
The application areas described above form a considerable market, and emerging markets will have an economic impact. For example, although the current volume of the virtual reality business is still relatively small analysts consider it to be one of the fastest growing areas of information technology. Marketing surveys indicate a strong market for C++ based development tools in these areas. The demand for a library like CGAL is apparent from the many questions on Internet about a library of geometric data types and algorithms. The availability of CGAL provides the industry with a solid development tool.
CGAL is used in application areas such as geographical information systems (GIS), robotics, virtual reality (VR), and shape reconstruction and matching.
Project URL: http://www.cs.uu.nl/CGAL/
Searching for OpenAIRE data...
There was an error trying to search data from OpenAIRE
No results available