songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
86,636 Commits 3 Branches 156 Tags 974 MiB
Commit Graph

430 Commits

Author SHA1 Message Date
Guillaume Damiand dcc78e85d2 Replace #include by forward declarations. 2019-07-09 12:08:49 +02:00
Laurent Rineau 41626a9a7b Force calls by ADL in import_from_halfedge_graph 
The member function `next` and `opposite` of the class prevent the
call of functions with the same name by ADL. For the BGL API, one has
to call by ADL. This commit adds two auxiliary functions, external to
the class, to enable to call  `next` and `opposite` by ADL.

The commit also adds a test with OpenMesh, to prove the correctness of
the modification.
 2019-07-05 10:42:03 +02:00
Guillaume Damiand 341b9943e5 Add missing #include 2019-07-02 11:32:01 +02:00
Guillaume Damiand 5b078e5bbf Merge branch 'Surface_mesh_topology-gdamiand' of github.com:gdamiand/cgal into Surface_mesh_topology-gdamiand 2019-06-28 14:41:49 +02:00
Guillaume Damiand 4ca4fc248d Remove warning 2019-06-28 14:40:24 +02:00
Guillaume Damiand 56abe3c367 Merge branch 'master' into Surface_mesh_topology-gdamiand 2019-06-28 13:28:50 +02:00
Guillaume Damiand 1dbc088459 Update licences; move undocumented files to internal (both directory and namespace) 2019-06-20 16:51:53 +02:00
Guillaume Damiand f80af5af90 Update to use new version of Polygonal_schema 2019-06-17 14:26:37 +02:00
Guillaume Damiand bf35f049e6 Start to implement Polygonal_schema: nyf 2019-06-14 16:38:47 +02:00
Guillaume Damiand 4e5b74efe8 Bugfix in copy 2019-06-14 13:04:25 +02:00
Guillaume Damiand 14615ea0aa Bug fix in copy method. 2019-06-14 10:47:25 +02:00
Andreas Fabri 1c9dbfcb95 Replace CGAL::Void* with std::nullptr_t 2019-06-05 13:47:00 +02:00
Andreas Fabri 4581f1b7a8 Morte replacements 2019-06-05 08:39:55 +02:00
Mael Rouxel-Labbé 2848158354 Fix typos 2019-05-20 08:54:04 +02:00
Guillaume Damiand 35634bdef3 Add computation of normal for face graphs. 2019-04-05 11:33:47 +02:00
Guillaume Damiand afa2417c16 Update lcc viewer with path to deal with Surface mesh and Polyhedron 2019-04-04 18:47:49 +02:00
Guillaume Damiand 260b3e54e3 Update 2019-04-04 15:51:15 +02:00
Guillaume Damiand 2110a22412 Use property map for face graph wrapper. 2019-04-02 10:33:37 +02:00
Guillaume Damiand 2f046604b6 First working version of Face_graph_wrapper. 2019-04-01 19:26:56 +02:00
Guillaume Damiand 79095e98bc Use method instead of global function. 2019-03-29 17:01:07 +01:00
Guillaume Damiand 5df0d6852c Start face graph wrapper. NYF. 2019-03-29 16:59:33 +01:00
Sébastien Loriot f62624c4f9 replace cpp11::tuple by std::tuple 2019-03-29 13:28:33 +01:00
Sébastien Loriot d60f5645aa replace BOOST_FOREACH by c++ ranged-based for loop 
some of the command used for the replacement:
ack --cpp  BOOST_FOREACH -l  | xargs sed -i -E "s/BOOST_FOREACH\(([a-zA-Z_:&0-9]+)\s(\w+)\,/for(\1 \2 :/"
ack --cpp  BOOST_FOREACH -l  | xargs sed -i -E "s/BOOST_FOREACH\((const [a-zA-Z_:&0-9]+)\s(\w+)\,/for(\1 \2 :/"
ack --cpp  BOOST_FOREACH -l  | xargs sed -i -E "s/BOOST_FOREACH\((const typename [a-zA-Z_:&0-9]+)\s(\w+)\,/for(\1 \2 :/"
ack --cpp  BOOST_FOREACH -l  | xargs sed -i -E "s/BOOST_FOREACH\((typename [<>a-zA-Z_:&0-9]+)\s(\w+)\,/for(\1 \2 :/"
ack "boost/foreach.hpp" -l --cpp | xargs sed -i '/boost\/foreach.hpp>/d'
 2019-03-29 13:22:15 +01:00
Sébastien Loriot 6e8e4a4b10 remove variadic template workaround for cmap, gmap, and lcell 2019-03-29 10:41:50 +01:00
Guillaume Damiand bbea8c7889 Add a method to import any HDS model into a CMap and a LCC 2019-03-15 16:53:47 +01:00
Guillaume Damiand 5279a690b3 Add method to import a model of Halfedge graph into a combinatorial map. 2019-03-15 08:13:16 +01:00
Guillaume Damiand 8e649a9d5d Start to add method to import Polyhedron and SM into a CMap. 2019-03-14 21:34:05 +01:00
Guillaume Damiand a211e558ee Copy methods are now able to keep mappings from copy to origin, and from origin to copy. 2018-12-20 08:51:04 +01:00
Guillaume Damiand 14e32aba01 Merge branch 'CMap-path_isotopy-gdamiand-old' into CMap-path_isotopy-gdamiand 2018-12-14 10:01:38 +01:00
Guillaume Damiand 0cc980f059 Update copy constructors and copy methods for CMap, GMap, and LCC to take a CMap/GMap/LCC as parameter and not any type. 2018-12-06 18:01:03 +01:00
Guillaume Damiand 63352c5680 Continue refactoring 2018-11-29 13:14:54 +01:00
Guillaume Damiand fdd08e9287 Create new package Surface_mesh_topology; move related files in this package. 2018-11-28 15:56:10 +01:00
Guillaume Damiand c3f55640ca Bug fix. 2018-11-28 12:47:43 +01:00
Guillaume Damiand 8433205b77 Small updates on path on surfaces. 2018-11-21 21:56:12 +01:00
Guillaume Damiand 094f28fdc9 Small bug fixes; add is_valid method in path with rle. 2018-11-21 12:01:51 +01:00
Guillaume Damiand 702d01e1f7 Start to replace totally the quadratic method by the linear one (nyf). 2018-11-20 16:49:28 +01:00
Guillaume Damiand 4b62197c72 Comment out an assertion which is too long. 2018-11-20 16:30:30 +01:00
Guillaume Damiand dd3309f14f Bugfix for path with 2 darts. 2018-11-20 11:37:28 +01:00
Guillaume Damiand 1c54999d7d Right shift for path with rle done. 2018-11-20 10:41:11 +01:00
Guillaume Damiand 8bc932ce91 Beginning of right shift for path with rle. 2018-11-19 22:15:00 +01:00
Guillaume Damiand c1ef7f334f Bracket flattening for path with rle ok. 2018-11-15 15:31:56 +01:00
Guillaume Damiand 4a9ee63b83 Add a method that allows to add several edges into a current facet. 2018-11-14 16:33:11 +01:00
Guillaume Damiand 828c01a00e Add a cmap builder that allows to build a combinatorial map by giving its edge labels. 2018-11-14 16:29:49 +01:00
Guillaume Damiand df5df7f443 Comment. 2018-11-09 13:40:49 +01:00
Guillaume Damiand 092baf908a Spurs removal is now ok for path with rle. 2018-11-09 13:05:23 +01:00
Guillaume Damiand 919d4714ac Start to work on path with rle, spurs removal. 2018-11-08 16:42:13 +01:00
Guillaume Damiand 4145ddeb0e Path on surface encoded with rle ok. 2018-11-08 12:41:03 +01:00
Guillaume Damiand 69e9ce3494 Start path with rle to optimize isotopy test. 2018-11-07 19:51:03 +01:00
Guillaume Damiand b040c5a983 Return always 0 for positive and negative turns, for spurs. 2018-11-06 17:04:40 +01:00
Guillaume Damiand 63334c3b60 New method to compute turns in constant time. 2018-10-26 16:49:45 +02:00