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

1968 Commits

Author SHA1 Message Date
Sébastien Loriot f5c550ef44 Merge remote-tracking branch 'cgal/6.0.x-branch' into 'cgal/6.1.x-branch' 2025-12-19 17:34:39 +01:00
Mael Rouxel-Labbé 511c3f14a5 Add missing space 2025-12-18 17:34:03 +01:00
Sébastien Loriot 9bd1705bf8 Merge remote-tracking branch 'cgal/6.0.x-branch' into 'cgal/6.1.x-branch' 2025-11-19 14:45:21 +01:00
Sébastien Loriot 066159f792 assertion should be before the removal... 2025-11-10 10:17:33 +01:00
Sébastien Loriot 3c7d507530 update doc + apply changes to the constrained version 2025-11-06 19:40:48 +01:00
Sébastien Loriot 25005a97d8 clean up 2025-11-03 09:24:31 +01:00
Sébastien Loriot 3fe83c7ce0 handle non-triangular faces 2025-10-31 11:36:44 +01:00
Sébastien Loriot 26b6857c4f follow up of commits making default value for dynamic maps a parameter pack 
the free function becomes a better match than with a default value for the default parameter
 2025-07-31 17:33:04 +02:00
Jane Tournois 0ab9d3eebf Merge remote-tracking branch 'cgal/master' into Triangulation_3-CDT_3-lrineau 
# Conflicts:
#	Installation/CHANGES.md
 2025-06-10 11:18:38 +02:00
Sébastien Loriot 4d13a4d509 better links 2025-05-22 18:56:23 +02:00
Sébastien Loriot 6d4dccdcd2 update links 2025-05-22 18:29:50 +02:00
Laurent Rineau 73fd95ab6b fix warnings 2025-05-20 16:49:14 +02:00
Andreas Fabri eeb4decd2a Use named parameter helper 2025-04-11 10:46:23 +02:00
Sebastien Loriot ede0864914
BGL - add `CGAL::dijkstra_shortest_path(vs, vt, mesh)` (#8724) 
## Summary of Changes

computes the shortest path between two vertices, using Dijkstra
algorithm

Todo
- [x] write doc and integrate to 
- [x] add np
- [x] add measure to define what "shortest" means
- [x] add to ref manual top page
- [x] use in demo code

## Release Management

* Affected package(s): BGL
* [Small
feature](https://cgalwiki.geometryfactory.com/CGAL/Members/wiki/Features/Small_Features/Add_CGAL::shortest_path(vs,_vt))
* Link to compiled documentation
[CGAL::shortest_path_between_two_vertices()](https://cgal.github.io/8724/v0/BGL/group__PkgBGLTraversal.html#ga5627dee8a6fe4d238cb5c91e123aa763)
* License and copyright ownership: unchanged
 2025-04-03 16:07:02 +02:00
Andreas Fabri 7b2517a736
Update BGL/include/CGAL/boost/graph/dijkstra_shortest_path.h 
Co-authored-by: Laurent Rineau <Laurent.Rineau@cgal.org>
 2025-03-21 10:24:34 +01:00
Andreas Fabri ce56424cd5 Add example; polish doc 2025-03-20 11:59:08 +01:00
Andreas Fabri 954ea5a5fc fix 2025-03-20 11:02:38 +01:00
Andreas Fabri 4014582c13 lowecase 2025-03-20 10:37:53 +01:00
Andreas Fabri d8248383a8 simplify the visitor 2025-03-20 10:29:35 +01:00
Andreas Fabri 8a749c5b61 simplify the code 2025-03-20 10:25:05 +01:00
Andreas Fabri 94801e8826 polish doc 2025-03-18 17:42:43 +01:00
Jane Tournois bcac630220 rename to dijkstra_shortest_path() 2025-03-18 17:11:00 +01:00
Jane Tournois 0e5ec52e31 doc template parameters 2025-03-04 14:45:08 +01:00
Jane Tournois 2cf5ed144c doc 2025-03-04 11:38:51 +01:00
Jane Tournois c1768cb725 add vertex_index_map and doc 2025-03-04 11:20:28 +01:00
Jane Tournois 7420b06cc6 define map type only once 2025-03-04 10:25:01 +01:00
Jane Tournois 73ed6f81da add missing typedef 2025-03-04 09:27:33 +01:00
Jane Tournois 737a05f998 v0 of using edge_relaxed to avoid re-circulating around each vertex after Dijkstra algo 2025-03-03 17:07:05 +01:00
Sven Oesau 24d44e786b Merge remote-tracking branch 'cgal/master' into PMP-PoissonDiskSampling-GF 2025-02-25 12:24:19 +01:00
Sven Oesau bee8a662f6 renaming helper struct to Vector_matching_point 
updates following review
 2025-02-25 12:20:51 +01:00
Sven Oesau d92cf1f6a8 added missing header 2025-02-14 13:59:31 +01:00
Sven Oesau d673998f52 integrating comments from reviews 
poisson_eliminate now works with d-dimensional points
 2025-02-14 13:24:16 +01:00
Sébastien Loriot 9c536ddae6 Merge pull request #8234 from MaelRL/BGL-Add_remove_deg_2_vertex-GF 
Add an Euler operation to remove degree 2 vertices
 2025-02-12 21:17:43 +01:00
Jane Tournois f24d3ca97f use Dijkstra_end_exception instead of std::exception 2025-02-04 18:50:34 +01:00
Jane Tournois a64af9881a doc 2025-02-03 15:43:00 +01:00
Jane Tournois 96cd968423 a little bit of doc + rename "mesh" to "graph" 2025-02-03 12:41:19 +01:00
Jane Tournois 0a8d61bbd1 add edge_weight property map 2025-02-03 11:59:04 +01:00
Jane Tournois c3cf48ca40 add np and return output iterator 2025-01-31 15:54:05 +01:00
Jane Tournois c935b7625f first version of shortest_path(vs, vt, mesh) 2025-01-31 14:25:59 +01:00
Sébastien Loriot 107f3696dc boost::tie -> std::tie 2025-01-24 14:20:00 +01:00
Sébastien Loriot 36d98614df Merge remote-tracking branch 'cgal/6.0.x-branch' 2025-01-09 19:23:19 +01:00
Sébastien Loriot 0eb709dd65 Merge remote-tracking branch 'cgal/5.6.x-branch' into HEAD 2025-01-09 19:22:39 +01:00
Sébastien Loriot 1e06a8813f handle special case when FFG has a non-manifold mesh and not all umbrellas are selected 2025-01-08 17:31:21 +01:00
Mael Rouxel-Labbé f6a121d335 Add doc for BGL's remove_degree_2_vertex() 2024-12-16 09:20:21 +01:00
Mael Rouxel-Labbé 2db11f6a2c Allow removing degree 2 vertices incident to a triangle face 2024-12-13 22:18:33 +01:00
Mael Rouxel-Labbé 9e5dcbf548 Merge remote-tracking branch 'cgal/master' into BGL-Add_remove_deg_2_vertex-GF 2024-12-13 14:44:04 +01:00
Sébastien Loriot 11640a3946 Merge remote-tracking branch 'cgal/6.0.x-branch' in master 2024-12-04 14:13:01 +01:00
Jane Tournois c4760da918 in OpenMesh, the outgoing halfedge of a boundary vertex must be the boundary halfedge 2024-12-03 10:48:57 +01:00
Sébastien Loriot 1b7e7bea6a fix dynamic with default for graph inheriting from another graph 2024-11-28 14:37:00 +01:00
Jane Tournois 7c156fa6cd use NP stream_precision 2024-11-15 14:59:21 +01:00