| Age | Commit message (Collapse) | Author |
|---|
|
Delaunay complex, use max_alpha_square=32 in the Python example
|
|
Delaunay_triangulation_off_rw.cpp with
Points_off_io.h and CGAL_points_off_reader.cpp
Adapt UT and examples for this
Adapt Alpha complex for it
Alpha complex is now inserting points in a faster way (after a spatial_sort).
Remove Alpha complex construction from a pointer on Delaunay triangulation (no more needed).
Adapt documentation to all these modifications
Forbid copy/move constructor/assignment operator on Alpha complex
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/alphashapes@1098 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: 08a673b66451b5cb03fbdf482d696d93b35d220f
|
|
vector of Points is a more efficient way (instead of inserting points on the fly).
As consequence, the documentation needs to be rewritten as the points index are changed.
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/alphashapes@1046 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: bdb0196b61418a983cfaf7f6781a3a2906e8b136
|
|
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/alphashapes@931 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: 578da0e6fff453560e666e8f00147f9e10cb6de6
|
