songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fix dependencies and some backticks

This commit is contained in:
Andreas Fabri 2024-01-15 16:20:09 +00:00
parent ae265012e3
commit 7aba8d344d
2 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Isosurfacing_3/doc/Isosurfacing_3/Isosurfacing_3.txt
View File

@ -139,8 +139,8 @@ Comparison between a cube generated by Marching Cubes (left) and Dual Contouring
Each algorithm can be called by a single templated function, and the function signature is common to all algorithms: Each algorithm can be called by a single templated function, and the function signature is common to all algorithms:
\code{.cpp} \code{.cpp}
template <typename ConcurrencyTag = Sequential_tag, class Domain_, class PointRange, class PolygonRange> template <typename ConcurrencyTag = Sequential_tag, class Domain, class PointRange, class PolygonRange>
void marching_cubes(const Domain_& domain, const typename Domain_::FT isovalue, PointRange& points, PolygonRange& polygons); void marching_cubes(const Domain& domain, const typename Domain::FT isovalue, PointRange& points, PolygonRange& polygons);
\endcode \endcode
The input is provided in the form of a `domain` (see \ref secmydomains). The input is provided in the form of a `domain` (see \ref secmydomains).
@ -152,7 +152,7 @@ The vertex positions are stored as `Point_3` in `points`. Each face in `polygons
Depending on the algorithm, the indexed face set may store either a polygon soup (unorganized polygons with no relationship whatsoever, i.e., no connectivity between them) or a mesh with connectivity. Depending on the algorithm, the indexed face set may store either a polygon soup (unorganized polygons with no relationship whatsoever, i.e., no connectivity between them) or a mesh with connectivity.
The isosurfacing algorithms can run either sequentially on one CPU core or in parallel on multicore architectures with shared memory. The isosurfacing algorithms can run either sequentially on one CPU core or in parallel on multicore architectures with shared memory.
The template parameter `ConcurrencyTag` is used to specify how the algorithm is executed: either Sequential_tag or Parallel_tag. The template parameter `ConcurrencyTag` is used to specify how the algorithm is executed: either `Sequential_tag` or `Parallel_tag`.
To enable parallelism, CGAL must be linked with the Intel TBB library. To enable parallelism, CGAL must be linked with the Intel TBB library.
When the parallel version is not available due to unsuccessful link with the TBB library, then the sequential version is utilized as a fallback. When the parallel version is not available due to unsuccessful link with the TBB library, then the sequential version is utilized as a fallback.

1
Isosurfacing_3/doc/Isosurfacing_3/dependencies
View File

@ -6,6 +6,5 @@ Algebraic_foundations
Circulator Circulator
Stream_support Stream_support
AABB_tree AABB_tree
CGAL_ImageIO
Polygon_mesh_processing Polygon_mesh_processing
Mesh_3 Mesh_3