summaryrefslogtreecommitdiff
path: root/src/Coxeter_triangulation/include/gudhi/Manifold_tracing.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/Coxeter_triangulation/include/gudhi/Manifold_tracing.h')
-rw-r--r--src/Coxeter_triangulation/include/gudhi/Manifold_tracing.h148
1 files changed, 56 insertions, 92 deletions
diff --git a/src/Coxeter_triangulation/include/gudhi/Manifold_tracing.h b/src/Coxeter_triangulation/include/gudhi/Manifold_tracing.h
index 25b664eb..b678566a 100644
--- a/src/Coxeter_triangulation/include/gudhi/Manifold_tracing.h
+++ b/src/Coxeter_triangulation/include/gudhi/Manifold_tracing.h
@@ -28,7 +28,7 @@ namespace coxeter_triangulation {
* \ingroup coxeter_triangulation
*/
-/** \class Manifold_tracing
+/** \class Manifold_tracing
* \brief A class that assembles methods for manifold tracing algorithm.
*
* \tparam Triangulation_ The type of the ambient triangulation.
@@ -36,9 +36,8 @@ namespace coxeter_triangulation {
*/
template <class Triangulation_>
class Manifold_tracing {
-
typedef typename Triangulation_::Simplex_handle Simplex_handle;
-
+
struct Simplex_hash {
typedef Simplex_handle argument_type;
typedef std::size_t result_type;
@@ -46,8 +45,8 @@ class Manifold_tracing {
return boost::hash<typename Simplex_handle::Vertex>()(s.vertex());
}
};
-
-public:
+
+ public:
/** \brief Type of the output simplex map with keys of type Triangulation_::Simplex_handle
* and values of type Eigen::VectorXd.
* This type should be used for the output in the method manifold_tracing_algorithm.
@@ -58,38 +57,34 @@ public:
* \brief Computes the set of k-simplices that intersect
* a boundaryless implicit manifold given by an intersection oracle, where k
* is the codimension of the manifold.
- * The computation is based on the seed propagation --- it starts at the
+ * The computation is based on the seed propagation --- it starts at the
* given seed points and then propagates along the manifold.
*
* \tparam Point_range Range of points of type Eigen::VectorXd.
* \tparam Intersection_oracle Intersection oracle that represents the manifold.
* Needs to be a model of the concept IntersectionOracle.
*
- * \param[in] seed_points The range of points on the manifold from which
+ * \param[in] seed_points The range of points on the manifold from which
* the computation begins.
* \param[in] triangulation The ambient triangulation.
* \param[in] oracle The intersection oracle for the manifold.
* The ambient dimension needs to match the dimension of the
* triangulation.
* \param[out] out_simplex_map The output map, where the keys are k-simplices in
- * the input triangulation that intersect the input manifold and the mapped values
+ * the input triangulation that intersect the input manifold and the mapped values
* are the intersection points.
*/
- template <class Point_range,
- class Intersection_oracle>
- void manifold_tracing_algorithm(const Point_range& seed_points,
- const Triangulation_& triangulation,
- const Intersection_oracle& oracle,
- Out_simplex_map& out_simplex_map) {
+ template <class Point_range, class Intersection_oracle>
+ void manifold_tracing_algorithm(const Point_range& seed_points, const Triangulation_& triangulation,
+ const Intersection_oracle& oracle, Out_simplex_map& out_simplex_map) {
std::size_t cod_d = oracle.cod_d();
std::queue<Simplex_handle> queue;
- for (const auto& p: seed_points) {
+ for (const auto& p : seed_points) {
Simplex_handle full_simplex = triangulation.locate_point(p);
- for (Simplex_handle face: full_simplex.face_range(cod_d)) {
+ for (Simplex_handle face : full_simplex.face_range(cod_d)) {
Query_result<Simplex_handle> qr = oracle.intersects(face, triangulation);
- if (qr.success &&
- out_simplex_map.emplace(std::make_pair(face, qr.intersection)).second) {
+ if (qr.success && out_simplex_map.emplace(std::make_pair(face, qr.intersection)).second) {
#ifdef GUDHI_COX_OUTPUT_TO_HTML
mt_seed_inserted_list.push_back(MT_inserted_info(qr, face, false));
#endif
@@ -98,17 +93,14 @@ public:
}
}
}
-
while (!queue.empty()) {
Simplex_handle s = queue.front();
queue.pop();
- for (auto cof: s.coface_range(cod_d+1)) {
- for (auto face: cof.face_range(cod_d)) {
+ for (auto cof : s.coface_range(cod_d + 1)) {
+ for (auto face : cof.face_range(cod_d)) {
Query_result<Simplex_handle> qr = oracle.intersects(face, triangulation);
- if (qr.success &&
- out_simplex_map.emplace(std::make_pair(face, qr.intersection)).second)
- queue.emplace(face);
+ if (qr.success && out_simplex_map.emplace(std::make_pair(face, qr.intersection)).second) queue.emplace(face);
}
}
}
@@ -118,85 +110,76 @@ public:
* \brief Computes the set of k-simplices that intersect
* the dimensional manifold given by an intersection oracle, where k
* is the codimension of the manifold.
- * The computation is based on the seed propagation --- it starts at the
+ * The computation is based on the seed propagation --- it starts at the
* given seed points and then propagates along the manifold.
*
* \tparam Point_range Range of points of type Eigen::VectorXd.
* \tparam Intersection_oracle Intersection oracle that represents the manifold.
* Needs to be a model of the concept IntersectionOracle.
*
- * \param[in] seed_points The range of points on the manifold from which
+ * \param[in] seed_points The range of points on the manifold from which
* the computation begins.
* \param[in] triangulation The ambient triangulation.
* \param[in] oracle The intersection oracle for the manifold.
* The ambient dimension needs to match the dimension of the
* triangulation.
* \param[out] interior_simplex_map The output map, where the keys are k-simplices in
- * the input triangulation that intersect the relative interior of the input manifold
+ * the input triangulation that intersect the relative interior of the input manifold
* and the mapped values are the intersection points.
* \param[out] boundary_simplex_map The output map, where the keys are k-simplices in
- * the input triangulation that intersect the boundary of the input manifold
+ * the input triangulation that intersect the boundary of the input manifold
* and the mapped values are the intersection points.
*/
- template <class Point_range,
- class Intersection_oracle>
- void manifold_tracing_algorithm(const Point_range& seed_points,
- const Triangulation_& triangulation,
- const Intersection_oracle& oracle,
- Out_simplex_map& interior_simplex_map,
+ template <class Point_range, class Intersection_oracle>
+ void manifold_tracing_algorithm(const Point_range& seed_points, const Triangulation_& triangulation,
+ const Intersection_oracle& oracle, Out_simplex_map& interior_simplex_map,
Out_simplex_map& boundary_simplex_map) {
std::size_t cod_d = oracle.cod_d();
std::queue<Simplex_handle> queue;
- for (const auto& p: seed_points) {
+ for (const auto& p : seed_points) {
Simplex_handle full_simplex = triangulation.locate_point(p);
- for (Simplex_handle face: full_simplex.face_range(cod_d)) {
+ for (Simplex_handle face : full_simplex.face_range(cod_d)) {
auto qr = oracle.intersects(face, triangulation);
#ifdef GUDHI_COX_OUTPUT_TO_HTML
mt_seed_inserted_list.push_back(MT_inserted_info(qr, face, false));
-#endif
+#endif
if (qr.success) {
if (oracle.lies_in_domain(qr.intersection, triangulation)) {
- if (interior_simplex_map.emplace(std::make_pair(face, qr.intersection)).second)
- queue.emplace(face);
- }
- else {
- for (Simplex_handle cof: face.coface_range(cod_d+1)) {
+ if (interior_simplex_map.emplace(std::make_pair(face, qr.intersection)).second) queue.emplace(face);
+ } else {
+ for (Simplex_handle cof : face.coface_range(cod_d + 1)) {
auto qrb = oracle.intersects_boundary(cof, triangulation);
#ifdef GUDHI_COX_OUTPUT_TO_HTML
mt_seed_inserted_list.push_back(MT_inserted_info(qrb, cof, true));
-#endif
- if (qrb.success)
- boundary_simplex_map.emplace(cof, qrb.intersection);
+#endif
+ if (qrb.success) boundary_simplex_map.emplace(cof, qrb.intersection);
}
}
// break;
}
}
}
-
+
while (!queue.empty()) {
Simplex_handle s = queue.front();
queue.pop();
- for (auto cof: s.coface_range(cod_d+1)) {
- for (auto face: cof.face_range(cod_d)) {
+ for (auto cof : s.coface_range(cod_d + 1)) {
+ for (auto face : cof.face_range(cod_d)) {
auto qr = oracle.intersects(face, triangulation);
#ifdef GUDHI_COX_OUTPUT_TO_HTML
mt_inserted_list.push_back(MT_inserted_info(qr, face, false));
-#endif
+#endif
if (qr.success) {
if (oracle.lies_in_domain(qr.intersection, triangulation)) {
- if (interior_simplex_map.emplace(face, qr.intersection).second)
- queue.emplace(face);
- }
- else {
+ if (interior_simplex_map.emplace(face, qr.intersection).second) queue.emplace(face);
+ } else {
auto qrb = oracle.intersects_boundary(cof, triangulation);
#ifdef GUDHI_COX_OUTPUT_TO_HTML
mt_inserted_list.push_back(MT_inserted_info(qrb, cof, true));
-#endif
+#endif
// assert (qrb.success); // always a success
- if (qrb.success)
- boundary_simplex_map.emplace(cof, qrb.intersection);
+ if (qrb.success) boundary_simplex_map.emplace(cof, qrb.intersection);
}
}
}
@@ -206,7 +189,6 @@ public:
/** \brief Empty constructor */
Manifold_tracing() {}
-
};
/**
@@ -214,7 +196,7 @@ public:
* that computes the set of k-simplices that intersect
* a boundaryless implicit manifold given by an intersection oracle, where k
* is the codimension of the manifold.
- * The computation is based on the seed propagation --- it starts at the
+ * The computation is based on the seed propagation --- it starts at the
* given seed points and then propagates along the manifold.
*
* \tparam Point_range Range of points of type Eigen::VectorXd.
@@ -224,38 +206,30 @@ public:
* Needs to be a model of the concept IntersectionOracle.
* \tparam Out_simplex_map Needs to be Manifold_tracing<Triangulation_>::Out_simplex_map.
*
- * \param[in] seed_points The range of points on the manifold from which
+ * \param[in] seed_points The range of points on the manifold from which
* the computation begins.
* \param[in] triangulation The ambient triangulation.
* \param[in] oracle The intersection oracle for the manifold.
* The ambient dimension needs to match the dimension of the
* triangulation.
* \param[out] out_simplex_map The output map, where the keys are k-simplices in
- * the input triangulation that intersect the input manifold and the mapped values
+ * the input triangulation that intersect the input manifold and the mapped values
* are the intersection points.
*
* \ingroup coxeter_triangulation
*/
-template <class Point_range,
- class Triangulation,
- class Intersection_oracle,
- class Out_simplex_map>
-void manifold_tracing_algorithm(const Point_range& seed_points,
- const Triangulation& triangulation,
- const Intersection_oracle& oracle,
- Out_simplex_map& out_simplex_map) {
+template <class Point_range, class Triangulation, class Intersection_oracle, class Out_simplex_map>
+void manifold_tracing_algorithm(const Point_range& seed_points, const Triangulation& triangulation,
+ const Intersection_oracle& oracle, Out_simplex_map& out_simplex_map) {
Manifold_tracing<Triangulation> mt;
- mt.manifold_tracing_algorithm(seed_points,
- triangulation,
- oracle,
- out_simplex_map);
+ mt.manifold_tracing_algorithm(seed_points, triangulation, oracle, out_simplex_map);
}
/**
* \brief Static method for Manifold_tracing<Triangulation_>::manifold_tracing_algorithm
* the dimensional manifold given by an intersection oracle, where k
* is the codimension of the manifold.
- * The computation is based on the seed propagation --- it starts at the
+ * The computation is based on the seed propagation --- it starts at the
* given seed points and then propagates along the manifold.
*
* \tparam Point_range Range of points of type Eigen::VectorXd.
@@ -265,41 +239,31 @@ void manifold_tracing_algorithm(const Point_range& seed_points,
* Needs to be a model of the concept IntersectionOracle.
* \tparam Out_simplex_map Needs to be Manifold_tracing<Triangulation_>::Out_simplex_map.
*
- * \param[in] seed_points The range of points on the manifold from which
+ * \param[in] seed_points The range of points on the manifold from which
* the computation begins.
* \param[in] triangulation The ambient triangulation.
* \param[in] oracle The intersection oracle for the manifold.
* The ambient dimension needs to match the dimension of the
* triangulation.
* \param[out] interior_simplex_map The output map, where the keys are k-simplices in
- * the input triangulation that intersect the relative interior of the input manifold
+ * the input triangulation that intersect the relative interior of the input manifold
* and the mapped values are the intersection points.
* \param[out] boundary_simplex_map The output map, where the keys are k-simplices in
- * the input triangulation that intersect the boundary of the input manifold
+ * the input triangulation that intersect the boundary of the input manifold
* and the mapped values are the intersection points.
*
* \ingroup coxeter_triangulation
*/
-template <class Point_range,
- class Triangulation,
- class Intersection_oracle,
- class Out_simplex_map>
-void manifold_tracing_algorithm(const Point_range& seed_points,
- const Triangulation& triangulation,
- const Intersection_oracle& oracle,
- Out_simplex_map& interior_simplex_map,
+template <class Point_range, class Triangulation, class Intersection_oracle, class Out_simplex_map>
+void manifold_tracing_algorithm(const Point_range& seed_points, const Triangulation& triangulation,
+ const Intersection_oracle& oracle, Out_simplex_map& interior_simplex_map,
Out_simplex_map& boundary_simplex_map) {
Manifold_tracing<Triangulation> mt;
- mt.manifold_tracing_algorithm(seed_points,
- triangulation,
- oracle,
- interior_simplex_map,
- boundary_simplex_map);
+ mt.manifold_tracing_algorithm(seed_points, triangulation, oracle, interior_simplex_map, boundary_simplex_map);
}
+} // namespace coxeter_triangulation
-} // namespace coxeter_triangulation
-
-} // namespace Gudhi
+} // namespace Gudhi
#endif
generated by cgit v1.2.3 (git 2.39.1) at 2024-07-02 07:31:23 +0000