cgal/Alpha_shapes_3 at af1844b51b82f4d9765e4064a208d217eb32ceed - cgal

History

Sébastien Loriot 52321a8cff update copyright and add an example using ExactAlphaComparisonTag		2011-12-27 16:15:09 +00:00
..
data	…
README	Replace Triangulaiton_hierarchy_3 by the Fast_location policy.	2009-11-04 13:21:12 +00:00
ex_alpha_shapes_3.cpp	merge candidate package into trunk	2010-12-08 17:39:30 +00:00
ex_alpha_shapes_exact_alpha.cpp	update copyright and add an example using ExactAlphaComparisonTag	2011-12-27 16:15:09 +00:00
ex_alpha_shapes_with_fast_location_3.cpp	Replace Triangulaiton_hierarchy_3 by the Fast_location policy.	2009-11-04 13:21:12 +00:00
ex_fixed_weighted_alpha_shapes_3.cpp	merge candidate package into trunk	2010-12-08 17:39:30 +00:00
ex_periodic_alpha_shapes_3.cpp	correct typo: replace binary by code	2009-12-04 12:24:33 +00:00
ex_weighted_alpha_shapes_3.cpp	deprecate class Weighted_alpha_shape_euclidean_traits_3, should use Regular_triangulation_euclidean_traits_3 instead.	2009-10-20 17:56:12 +00: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.