mirror of https://github.com/CGAL/cgal
algorithmsarrangeboolean-operationsc-plus-pluscgalcomputational-geometrycppgeometrygeometry-processinglibrarymesh-processingmeshespoint-cloudpolygontemplate-librarytriangulationvoronoi-diagram
7fdd7c1eca
The overnight documentation build gives a warning (with the doxygen master version): ``` /home/cgal-testsuite/cgal_doc_build/CGAL-6.2-Ic-24/include/CGAL/Frechet_distance/Neighbor_search.h:106: warning: no matching class member found for template < PointRange, Traits > std::vector< std::size_t > CGAL::Frechet_distance::Neighbor_search< PointRange, Traits >::get_close_curves(const PointRange &curve, double distance, Sequential_tag) ->std::vector< std::size_t > Possible candidates: 'template < ConcurrencyTag > std::vector< std::size_t > CGAL::Frechet_distance::Neighbor_search< PointRange, Traits >::get_close_curves(const PointRange &query, double distance)' at line 79 of file /home/cgal-testsuite/cgal_doc_build/CGAL-6.2-Ic-24/include/CGAL/Frechet_distance/Neighbor_search.h 'std::vector< std::size_t > CGAL::Frechet_distance::Neighbor_search< PointRange, Traits >::get_close_curves(const PointRange &query, double distance, Sequential_tag)' at line 90 of file /home/cgal-testsuite/cgal_doc_build/CGAL-6.2-Ic-24/include/CGAL/Frechet_distance/Neighbor_search.h ``` In principle the code is correct but due to the double usage of `std::vector< std::size_t >` doxygen has a small problem (since the integration of the fix for https://github.com/doxygen/doxygen/issues/11787). The workaround as used by CGAL is not necessary. (tested documentation against doxygen master version and dixygen 1.9.6) |
||
|---|---|---|
| .devcontainer/doxygen-cgal | ||
| .github | ||
| AABB_tree | ||
| Advancing_front_surface_reconstruction | ||
| Algebraic_foundations | ||
| Algebraic_kernel_d | ||
| Algebraic_kernel_for_circles | ||
| Algebraic_kernel_for_spheres | ||
| Alpha_shapes_2 | ||
| Alpha_shapes_3 | ||
| Alpha_wrap_3 | ||
| Apollonius_graph_2 | ||
| Arithmetic_kernel | ||
| Arrangement_on_surface_2 | ||
| BGL | ||
| Barycentric_coordinates_2 | ||
| Basic_viewer | ||
| Boolean_set_operations_2 | ||
| Bounding_volumes | ||
| Box_intersection_d | ||
| CGAL_Core | ||
| CGAL_ImageIO | ||
| CGAL_ipelets | ||
| Cartesian_kernel | ||
| Circular_kernel_2 | ||
| Circular_kernel_3 | ||
| Circulator | ||
| Classification | ||
| Combinatorial_map | ||
| Cone_spanners_2 | ||
| Constrained_triangulation_3 | ||
| Convex_decomposition_3 | ||
| Convex_hull_2 | ||
| Convex_hull_3 | ||
| Convex_hull_d | ||
| Data/data | ||
| Distance_2 | ||
| Distance_3 | ||
| Documentation/doc | ||
| Envelope_2 | ||
| Envelope_3 | ||
| Filtered_kernel | ||
| Frechet_distance | ||
| Generalized_map | ||
| Generator | ||
| GraphicsView | ||
| HalfedgeDS | ||
| Hash_map | ||
| Heat_method_3 | ||
| Homogeneous_kernel | ||
| Hyperbolic_triangulation_2 | ||
| Inscribed_areas | ||
| Installation | ||
| Interpolation | ||
| Intersections_2 | ||
| Intersections_3 | ||
| Interval_skip_list | ||
| Interval_support | ||
| Isosurfacing_3 | ||
| Jet_fitting_3 | ||
| Kernel_23 | ||
| Kernel_d | ||
| Kinetic_space_partition | ||
| Kinetic_surface_reconstruction | ||
| LEDA | ||
| LICENSES | ||
| Lab | ||
| Linear_cell_complex | ||
| Maintenance | ||
| Matrix_search | ||
| Mesh_2 | ||
| Mesh_3 | ||
| Mesher_level | ||
| Minkowski_sum_2 | ||
| Minkowski_sum_3 | ||
| Miscellany/doc/Miscellany | ||
| Modifier | ||
| Modular_arithmetic | ||
| Nef_2 | ||
| Nef_3 | ||
| Nef_S2 | ||
| NewKernel_d | ||
| Number_types | ||
| Optimal_bounding_box | ||
| Optimal_transportation_reconstruction_2 | ||
| Optimisation_basic | ||
| Orthtree | ||
| Partition_2 | ||
| Periodic_2_triangulation_2 | ||
| Periodic_3_mesh_3 | ||
| Periodic_3_triangulation_3 | ||
| Periodic_4_hyperbolic_triangulation_2 | ||
| Point_set_2 | ||
| Point_set_3 | ||
| Point_set_processing_3 | ||
| Poisson_surface_reconstruction_3 | ||
| Polygon | ||
| Polygon_mesh_processing | ||
| Polygon_repair | ||
| Polygonal_surface_reconstruction | ||
| Polyhedron | ||
| Polyline_simplification_2 | ||
| Polynomial | ||
| Polytope_distance_d | ||
| Principal_component_analysis | ||
| Principal_component_analysis_LGPL | ||
| Profiling_tools | ||
| Property_map | ||
| QP_solver | ||
| Random_numbers | ||
| Ridges_3 | ||
| SMDS_3 | ||
| STL_Extension | ||
| Scale_space_reconstruction_3 | ||
| Scripts | ||
| SearchStructures | ||
| Segment_Delaunay_graph_2 | ||
| Segment_Delaunay_graph_Linf_2 | ||
| Set_movable_separability_2 | ||
| Shape_detection | ||
| Shape_regularization | ||
| Skin_surface_3 | ||
| Snap_rounding_2 | ||
| Solver_interface | ||
| Spatial_searching | ||
| Spatial_sorting | ||
| Straight_skeleton_2 | ||
| Straight_skeleton_extrusion_2 | ||
| Stream_lines_2 | ||
| Stream_support | ||
| Subdivision_method_3 | ||
| Surface_mesh | ||
| Surface_mesh_approximation | ||
| Surface_mesh_deformation | ||
| Surface_mesh_parameterization | ||
| Surface_mesh_segmentation | ||
| Surface_mesh_shortest_path | ||
| Surface_mesh_simplification | ||
| Surface_mesh_skeletonization | ||
| Surface_mesh_topology | ||
| Surface_mesher | ||
| Surface_sweep_2 | ||
| TDS_2 | ||
| TDS_3 | ||
| Testsuite | ||
| Tetrahedral_remeshing | ||
| Three | ||
| Triangulation | ||
| Triangulation_2 | ||
| Triangulation_3 | ||
| Triangulation_on_hyperbolic_surface_2 | ||
| Triangulation_on_sphere_2 | ||
| Union_find | ||
| Visibility_2 | ||
| Voronoi_diagram_2 | ||
| Weights | ||
| .clang-format | ||
| .clang-tidy | ||
| .gitattributes | ||
| .gitignore | ||
| .markdownlint.json | ||
| CGALConfig.cmake | ||
| CGALConfigVersion.cmake | ||
| CMakeLists.txt | ||
| INSTALL.md | ||
| LICENSE.md | ||
| README.md | ||
| REUSE.toml | ||
| cmake_uninstall.cmake.in | ||
| copyright | ||
README.md
The Computational Geometry Algorithms Library (CGAL) is a C++ library that aims to provide easy access to efficient and reliable algorithms in computational geometry.
CGAL Releases
The primary vector of distribution of CGAL are source tarballs, released twice a year, announced on the web site of CGAL.
Getting Started with CGAL
Since version 5.0, CGAL is a header-only library, meaning that it is no longer needed to build CGAL libraries before it can be used.
Head over to the CGAL manual for usage guides and tutorials that will get you started smoothly.
License
See the file LICENSE.md.
CGAL Git Repository Layout
The Git repository of CGAL has a different layout from release tarballs. It
contains a CMakeLists.txt file that serves as anchor for configuring and building programs,
and a set of subfolders, so called packages. Most packages
implement a data structure or an algorithm for CGAL (e.g., Convex_hull_2,
or Triangulation_3); however some packages serve special needs:
Installation- meta-files and CMake-supportMaintenance- infrastructural supportCore,CGALimageIO,Qt_widget,GraphicsView- component librariesScripts- scripts to simplify developer's and user's workTestsuite- infrastructure for testsuiteDocumentation- infrastructure for CGAL's manualSTL_Extension- extensions to the standard template library