cgal/Alpha_shapes_3/examples/Alpha_shapes_3
Laurent Rineau 4fbf00fb8a CMake>=3.13: opt for for new policies up to 3.15 2019-06-19 14:34:59 +02:00
..
data
CMakeLists.txt CMake>=3.13: opt for for new policies up to 3.15 2019-06-19 14:34:59 +02:00
README Replace Triangulaiton_hierarchy_3 by the Fast_location policy. 2009-11-04 13:21:12 +00:00
ex_alpha_shapes_3.cpp Fixed a bunch of Alpha shape 3-related headers 2017-08-23 17:16:07 +02:00
ex_alpha_shapes_exact_alpha.cpp Fixed a bunch of Alpha shape 3-related headers 2017-08-23 17:16:07 +02:00
ex_alpha_shapes_with_fast_location_3.cpp Fixed a bunch of Alpha shape 3-related headers 2017-08-23 17:16:07 +02:00
ex_fixed_weighted_alpha_shapes_3.cpp Fixed a bunch of Alpha shape 3-related headers 2017-08-23 17:16:07 +02:00
ex_periodic_alpha_shapes_3.cpp Fixed a bunch of Alpha shape 3-related headers 2017-08-23 17:16:07 +02:00
ex_weighted_alpha_shapes_3.cpp Fixed a bunch of Alpha shape 3-related headers 2017-08-23 17:16:07 +02:00
ex_weighted_periodic_alpha_shapes_3.cpp Fixed a bunch of Alpha shape 3-related headers 2017-08-23 17:16:07 +02:00
visible_alpha_shape_facets_to_OFF.cpp replace BOOST_FOREACH by c++ ranged-based for loop 2019-03-29 13:22:15 +01:00

README

ex_alpha_shapes_3 : read input points, compute the alpha shape in 
regularized mode and find the optimal value of $\alpha$, i. e. the smallest
$\alpha$ such that all input points are in the interior or on the boundary of
the alpha shape, and the alpha shape has a single connected component.

ex_alpha_shapes_with_fast_location_3 : build the alpha shape using an
underlying Delaunay triangulation with Fast_location policy, for efficient
point location.

ex_weighted_alpha_shapes_3 : build the weighted alpha shape of a small
set of spheres and explore the boundary of the alpha complex for $\alpha=0$.
This complex is the nerve of the union of the spheres.