summaryrefslogtreecommitdiff
path: root/geom_bottleneck/include/bound_match.h
diff options
context:
space:
mode:
authorArnur Nigmetov <a.nigmetov@gmail.com>2018-06-03 22:39:49 +0200
committerArnur Nigmetov <a.nigmetov@gmail.com>2018-06-03 22:39:49 +0200
commita9d06f12ecbaa055d17970e09827ea7b67d1f53c (patch)
treec3fd2db39266cb76b3d8eefb005c0580ed97dfbd /geom_bottleneck/include/bound_match.h
parentc76e88bca80bfb4d29684891f2a954064532c2d0 (diff)
First tests added
Preparation for longest edge computation.
Diffstat (limited to 'geom_bottleneck/include/bound_match.h')
-rw-r--r--geom_bottleneck/include/bound_match.h2
1 files changed, 2 insertions, 0 deletions
diff --git a/geom_bottleneck/include/bound_match.h b/geom_bottleneck/include/bound_match.h
index 770c7df..99543f9 100644
--- a/geom_bottleneck/include/bound_match.h
+++ b/geom_bottleneck/include/bound_match.h
@@ -56,6 +56,7 @@ public:
bool getMatchedVertex(const DgmPoint& p, DgmPoint& result) const;
bool isPerfect() const;
void trimMatching(const Real newThreshold);
+ MatchingEdge<Real> get_longest_edge() const;
#ifndef FOR_R_TDA
template<class R>
friend std::ostream& operator<<(std::ostream& output, const Matching<R>& m);
@@ -82,6 +83,7 @@ public:
BoundMatchOracle(DgmPointSet psA, DgmPointSet psB, Real dEps, bool useRS = true);
bool isMatchLess(Real r);
bool buildMatchingForThreshold(const Real r);
+ MatchingEdge<Real> get_longest_edge() const { return M.get_longest_edge(); }
private:
DgmPointSet A, B;
Matching<Real> M;