Commit Graph

1245 Commits

Author SHA1 Message Date
Laurent Rineau 6ea415022b Merge pull request #1885 from maxGimeno/Tet_soup_in_c3t3-GF
Add a .mesh reader
2017-02-10 19:03:49 +01:00
Maxime Gimeno cc64739c66 Fixes :
- set the dimension of vertices without connectivity to -1 (fixes the BBox's problem)
- re-center the cut-plane after every type of load (fixes the cutplane problem)
2017-02-10 10:10:00 +01:00
Laurent Rineau 3ef84ed758 Merge pull request #1893 from janetournois/Mesh_3-reorganize_experimental-GF
Mesh_3 experimental code - reorganize headers
2017-02-09 18:42:39 +01:00
Jane Tournois eb6797f6b6 include license file header in new files 2017-02-09 16:25:24 +01:00
Jane Tournois 09d09a4dc3 update license preamble 2017-02-09 16:18:36 +01:00
Jane Tournois 4d35f9a36a add wrapper sizing function that is the minimum of 2 sizing fields 2017-02-09 14:25:52 +01:00
Jane Tournois ff36a27ba2 move files to Mesh_3/include/CGAL/Mesh_3/experimental 2017-02-09 14:19:07 +01:00
Maxime Gimeno ef764634b4 Replace the CGAL_precondition about empty finite cells by a warning. 2017-02-08 11:42:18 +01:00
Maxime Gimeno 7a3520b28d Clean-up 2017-02-08 11:42:18 +01:00
Jane Tournois 7fca673ed6 there is no need to collect the connectivity between infinite facets
warning : putting 'end' out of the for loop end condition evaluation is
important. It avoids to continue the loop on newly added things

The condition on the size of `incident_cells_map` inside `assign_neighbors`
is not correct anymore, because there are 4 facets per finite cell
+ 1 facet per infinite cell (boundary facets)
2017-02-08 11:42:18 +01:00
Maxime Gimeno e93b38406c Read the vertices references and discard them 2017-02-08 11:42:18 +01:00
Jane Tournois f86f84db16 revert commit 1602b59845d054b89bf2d0f426943746a9640c2c 2017-02-08 11:42:17 +01:00
Maxime Gimeno 1845bf8c51 Clean-up 2017-02-08 11:42:17 +01:00
Jane Tournois 4b00e1a990 fix orientation and index for built infinite cells
the index does not matter, and the orientation depends on the parity
of i.
Here it does not matter much because infinite cells will not be used,
but let's keep the code as generic as possible
2017-02-08 11:42:17 +01:00
Jane Tournois 1086a8f7ef this precondition is wrong in the general case 2017-02-08 11:42:17 +01:00
Maxime Gimeno f8d8c012f4 Re-indentation 2017-02-08 11:42:16 +01:00
Maxime Gimeno 5e487d75a4 Move Enum to cpp and add license files 2017-02-08 11:42:16 +01:00
Maxime Gimeno a50606ca6f Add a .mesh reader for the c3t3 item 2017-02-08 11:42:14 +01:00
Laurent Rineau 760076510c Merge pull request #1845 from lrineau/Mesh_3-fix_detect_features-GF
Various modifications of Mesh_3
2017-02-06 15:19:31 +01:00
Laurent Rineau 5b19c47bac Fix a warning 2017-02-03 16:43:36 +01:00
Laurent Rineau 9b05a3a5a9 Replace CGAL_MESH_3_NO_PROTECTION_NON_LINEAR by a Boolean
The Boolean `nonlinear_growth_of_balls` can be set by the
non-documented API:
  - the function `Protect_edges_sizing_field::set_nonlinear_growth_of_balls()`,
  - the Boolean `Mesh_3_options.nonlinear_growth_of_balls`.

Of course the demo sets that Boolean when possible.
2017-01-25 16:18:10 +01:00
Sébastien Loriot 50510c05ea add include directive for license of all GPL header files
done using:
ack-grep "^GPL" */package_info/*/license.txt -l | awk -F "/" '{print $1}' > /tmp/gpl_packages
for i in `cat /tmp/gpl_packages | \
          grep -v Operations_on_polyhedra | \
          grep -v Algebraic_kernel_for_circles | \
          grep -v Algebraic_kernel_for_spheres | \
          grep -v Polyhedron_IO`;
do
  echo $i
  python Scripts/developer_scripts/add_license_in_pkg_header.py $i
done
python Scripts/developer_scripts/add_license_in_pkg_header.py Operations_on_polyhedra Polygon_mesh_processing
python Scripts/developer_scripts/add_license_in_pkg_header.py Algebraic_kernel_for_circles Circular_kernel_2
python Scripts/developer_scripts/add_license_in_pkg_header.py Algebraic_kernel_for_spheres Circular_kernel_3
python Scripts/developer_scripts/add_license_in_pkg_header.py Polyhedron_IO Polyhedron
2017-01-19 15:20:25 +01:00
Laurent Rineau ff1f7f2f02 Function to get the number of detected patches 2017-01-19 11:29:42 +01:00
Laurent Rineau ad1b4fe0fc Refine the use of CGAL_MESH_3_PROTECTION_DEBUG 2017-01-19 11:29:42 +01:00
Laurent Rineau dfe8703b21 Access the bounding AABB tree 2017-01-19 11:29:42 +01:00
Laurent Rineau ad3424c41f Update the copyright
There is no longer any line of this file wrote by Stéphane!
2017-01-19 11:29:42 +01:00
Laurent Rineau 099af18b65 Fix detect_features when the domain has several polyhedra 2017-01-19 11:29:42 +01:00
Laurent Rineau ebcc2eaaa0 Compilation fix for test_backward_compatibility.cpp 2017-01-10 11:22:59 +01:00
Laurent Rineau 244ebc1621 Simplify 2017-01-05 15:45:54 +01:00
Laurent Rineau 56285ef220 std::cerr only if CGAL_MESH_3_VERBOSE 2017-01-05 15:45:04 +01:00
Laurent Rineau d3da0be120 Fix detect_features() 2017-01-04 15:49:41 +01:00
Laurent Rineau 2016805734 Reimplement constructors
- In `Polyhedral_mesh_domain_3`:

  - The handling of `p_rng_` is now simpler: the `Random` generator is
    only created just before its use. That reduces code duplication
    between constructors.

  - Use `add_primitives()` and `add_primitives_to_bounding_tree()`, and
    `build()` to reduce the code duplication between all constructors.

- In `Polyhedral_mesh_domain_with_features_3`:

  - All polyhedra are stored in a data member `this->stored_polyhedra`.

  - Always construct the base class without any polyhedron, then use
    `add_primitives()` and `add_primitives_to_bounding_tree()`, from
    polyhedra of `this->stored_polyhedra`.

  - All constructors are inlined in the class (now that their code is
    shorter).

  - Fix the compilation of `detect_borders()`.
2017-01-04 15:45:22 +01:00
Laurent Rineau 29f92b72ce Reimplement detect_borders() with detect_features() 2016-12-30 17:33:36 +01:00
Laurent Rineau ca0fac22e7 Merge branch 'Mesh_3-improve_detect_features-GF' into Mesh_3-various_improvements-lrineau 2016-12-30 17:33:16 +01:00
Laurent Rineau 256416e751 Reimplement detect_features using split_graph_into_polylines (2) 2016-12-30 17:07:16 +01:00
Laurent Rineau 0061a43ec7 CGAL::Real_timer for the building of AABB trees 2016-12-30 16:44:09 +01:00
Laurent Rineau 30397ce22e Integrate Sizing_field_with_aabb_tree in the demo 2016-12-30 16:44:09 +01:00
Laurent Rineau 65c5bd7579 Add the possibility to add new abstract criteria
In `Mesh_criteria_3`, add functions:
- `void add_facet_criterion(Abstract_facet_criterion*)`
- `void  add_cell_criterion(Abstract_cell_criterion*)`
2016-12-30 16:44:08 +01:00
Laurent Rineau 1b8b63c485 Reimplement detect_features using split_graph_into_polylines (1) 2016-12-30 14:51:50 +01:00
Laurent Rineau 7776720ca9 Merge pull request #1752 from lrineau/Mesh_3-various_fixes_and_improvements-lrineau
Fix the patch from #1524
2016-12-28 16:12:14 +01:00
Laurent Rineau bbf430b0b1 Merge pull request #585 from afabri/Kernel-Weighted_point-GF
Introduce Kernel::Weighted_point_3 together with functors
2016-12-20 19:52:02 +01:00
Laurent Rineau acc9581342 Split angle: from 135° to 90°. 2016-12-07 11:24:28 +01:00
Laurent Rineau 49053ee10b Improve display_corner_incidences()
Now the method also displays the points of corners.
2016-12-07 11:24:28 +01:00
Laurent Rineau 6214312575 For CGAL_MESH_3_PROTECTION_DEBUG 2016-12-07 11:24:28 +01:00
Laurent Rineau 0e59869580 Add a CGAL_error_msg when the sizing is locally zero 2016-11-23 11:59:53 +01:00
Jane Tournois 9187318744 Revert "convert weighted points to bare points when needed"
This reverts commits 19dadd6d58
and 137fe12b6b

We now use Kernel functors instead of Construct_point_3 converters,
because they work with both Point_3 and Weighted_point_3
2016-11-04 15:41:00 +01:00
Jane Tournois 19dadd6d58 convert weighted points to bare points when needed 2016-11-04 12:27:56 +01:00
Jane Tournois 137fe12b6b convert weighted points to bare points 2016-11-03 17:02:34 +01:00
Andreas Fabri 2c7bed8b92 Use ->point(), because a weighted point no longer derives from Point_3 2016-11-03 14:53:54 +01:00
Andreas Fabri ad9d2c369c Rename tests following Olivier's recommendations 2016-11-03 14:53:54 +01:00