mirror of https://github.com/CGAL/cgal
algorithmsarrangeboolean-operationsc-plus-pluscgalcomputational-geometrycppgeometrygeometry-processinglibrarymesh-processingmeshespoint-cloudpolygontemplate-librarytriangulationvoronoi-diagram
c40d7124d0
When `Constrained_triangulation_2` computes the intersection of two segments, with a floating-point number type, and with `Exact_predicates_tag`, the computed intersection point is snapped to an extremity of the two segments, if it is closest to 4 ulp (with the l-inf distance). That value `4` can be changed by defining the macro `CGAL_CDT_2_INTERSECTION_SNAPPING_ULP_DISTANCE` to another value. |
||
|---|---|---|
| .github | ||
| .travis | ||
| 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 | ||
| Apollonius_graph_2 | ||
| Arithmetic_kernel | ||
| Arrangement_on_surface_2 | ||
| BGL | ||
| Barycentric_coordinates_2 | ||
| Boolean_set_operations_2 | ||
| Bounding_volumes | ||
| Box_intersection_d | ||
| CGAL_Core | ||
| CGAL_ImageIO | ||
| CGAL_ipelets | ||
| Cartesian_kernel | ||
| Circular_kernel_2 | ||
| Circular_kernel_3 | ||
| Circulator | ||
| Combinatorial_map | ||
| Cone_spanners_2 | ||
| Convex_decomposition_3 | ||
| Convex_hull_2 | ||
| Convex_hull_3 | ||
| Convex_hull_d | ||
| Distance_2 | ||
| Distance_3 | ||
| Documentation/doc | ||
| Envelope_2 | ||
| Envelope_3 | ||
| Filtered_kernel | ||
| Generalized_map | ||
| Generator | ||
| Geomview | ||
| GraphicsView | ||
| HalfedgeDS | ||
| Hash_map | ||
| Homogeneous_kernel | ||
| Inscribed_areas | ||
| Installation | ||
| Interpolation | ||
| Intersections_2 | ||
| Intersections_3 | ||
| Interval_skip_list | ||
| Interval_support | ||
| Inventor | ||
| Jet_fitting_3 | ||
| Kernel_23 | ||
| Kernel_d | ||
| Kinetic_data_structures | ||
| Kinetic_framework | ||
| LEDA | ||
| Linear_cell_complex | ||
| MacOSX | ||
| 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 | ||
| OpenNL | ||
| Operations_on_polyhedra | ||
| Optimal_transportation_reconstruction_2 | ||
| Optimisation_basic | ||
| Partition_2 | ||
| Periodic_2_triangulation_2 | ||
| Periodic_3_triangulation_3 | ||
| Point_set_2 | ||
| Point_set_3 | ||
| Point_set_processing_3 | ||
| Point_set_shape_detection_3 | ||
| Poisson_surface_reconstruction_3 | ||
| Polygon | ||
| Polygon_mesh_processing | ||
| Polyhedron | ||
| Polyhedron_IO | ||
| Polyline_simplification_2 | ||
| Polynomial | ||
| Polytope_distance_d | ||
| Principal_component_analysis | ||
| Principal_component_analysis_LGPL | ||
| Profiling_tools | ||
| Property_map | ||
| QP_solver | ||
| Random_numbers | ||
| Ridges_3 | ||
| STL_Extension | ||
| Scale_space_reconstruction_3 | ||
| Scripts | ||
| SearchStructures | ||
| Segment_Delaunay_graph_2 | ||
| Segment_Delaunay_graph_Linf_2 | ||
| Skin_surface_3 | ||
| Snap_rounding_2 | ||
| Solver_interface | ||
| Spatial_searching | ||
| Spatial_sorting | ||
| Straight_skeleton_2 | ||
| Stream_lines_2 | ||
| Stream_support | ||
| Subdivision_method_3 | ||
| Surface_mesh | ||
| Surface_mesh_deformation | ||
| Surface_mesh_parameterization | ||
| Surface_mesh_segmentation | ||
| Surface_mesh_shortest_path | ||
| Surface_mesh_simplification | ||
| Surface_mesh_skeletonization | ||
| Surface_mesher | ||
| Sweep_line_2 | ||
| TDS_2 | ||
| TDS_3 | ||
| Testsuite | ||
| Three | ||
| Triangulation | ||
| Triangulation_2 | ||
| Triangulation_3 | ||
| Union_find | ||
| Visibility_2 | ||
| Voronoi_diagram_2 | ||
| wininst | ||
| .gitattributes | ||
| .gitignore | ||
| .travis.yml | ||
| CMakeLists.txt | ||
| INSTALL.md | ||
| LICENSE.md | ||
| README.md | ||
| 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 sources tarballs, released twice a year, announced on the web site of CGAL. The sources distributed that way can be built using the CGAL installation manual.
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 building, 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
Compilation and installation
The compilation and installation of CGAL from a sources tarball are described in the CGAL installation manual and in the file INSTALL.md that is at the root of any sources tarball.
CGAL developers, however, usually compile CGAL directly from a local Git repository. That kind of compilation is called a branch build, and is described in the file INSTALL.md that is at the root of the Git repository.
License
See the file LICENSE.md.