## Summary of Changes
Results of examples were using a file path with a folder.
## Release Management
* Affected package(s): Polygonal Surface Reconstruction
## Summary of Changes
Simple reformating of those files.
## Release Management
* Affected package(s): Installation
No need to test in testsuite: test only the CI Action "REUSE" .
## Summary of Changes
While experimenting on self-intersecting polyhedral surfaces, I met two
bugs:
* `edge_min_size` was not enough taken into account in
`Protect_edges_sizing_field`,
* `edge_distance` was missing the information of which `curve_id` the
edge belongs to (available using internal code)
causing crashes.
## Release Management
* Affected package(s): Mesh_3
* License and copyright ownership: unchanged
## Summary of Changes
This PR removes outdated conditional blocks that check for specific Qt
versions since CGAL now uses Qt6 exclusively.
## Release Management
* Issue(s) solved (if any): #8381
## Summary of Changes
Fix the case of surfaces with borders. Then they may be incident to only
the unbounded volume which so far was ignored.
## Release Management
* Affected package(s): Nef_polyhedron_3
* Issue(s) solved (if any): fix#6423
## Summary of Changes
Some non intersection is wrongfully detected as an intersection for the
Line_3 Ray_3 combination. Here is an illustration:
The base code is :
```cpp
if(!do_intersect(l, r.supporting_line()))
return false;
typename K::Coplanar_orientation_3 pred = k.coplanar_orientation_3_object();
CGAL::Orientation p0p1s = pred(l.point(0), l.point(1), r.source());
if(p0p1s == COLLINEAR)
return true;
CGAL::Orientation stp0 = pred(r.source(), r.second_point(), l.point(0));
if(stp0 == COLLINEAR)
return Ray_3_has_on_collinear_Point_3(r,l.point(0),k);
return (p0p1s != stp0);
```
The supporting line of the ray intersects the line, and then nothing is
collinear, so we check L0,L1,R1 vs R0,R1,L0, which are of opposite sign
so there is an intersection... but there is none.
This check is very similar to what is done in Ray_3-Ray_3, where it is
correct.
I did a naive fix for now: without loss of generality we can go to the
configuration below
and so we have an intersection as long as the ray "points" in the other
slab wrt to the line. And so, in coplanar orientation checks, if the
orientation L0,L1,R0 differs from L0, L1, (L0 + (R1-R0)).
I feel like I could probably skip at least a translation by having
something like Coplanar_orientation(P3, P3, P3, V3), and maybe even
more...
## Release Management
* Affected package(s): `Intersections_3`
* Issue(s) solved (if any): -
* Feature/Small Feature (if any): -
* License and copyright ownership: no change
## Summary of Changes
Polygonal faces are now triangulated and face normals are calculated
using PMP::compute_face_normal.
The calculated face normals and triangulations are buffered in
Least_squares_plane_fit_region. However, Least_squares_plane_fit_sorting
is independent and does not benefit from that buffered data.
## Release Management
* Affected package(s): Shape_detection
* Issue(s) solved (if any): fix#7992
Sebastien Loriot
albert-github
Laurent Rineau
Sven Oesau
Nicolas Saillant
Jane Tournois
Sebastien Loriot