• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1[/============================================================================
2  Boost.Geometry (aka GGL, Generic Geometry Library)
3
4  Copyright (c) 2007-2013 Barend Gehrels, Amsterdam, the Netherlands.
5  Copyright (c) 2008-2013 Bruno Lalande, Paris, France.
6  Copyright (c) 2009-2013 Mateusz Loskot, London, UK.
7
8  Use, modification and distribution is subject to the Boost Software License,
9  Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
10  http://www.boost.org/LICENSE_1_0.txt)
11=============================================================================/]
12
13
14[/ Generated by doxygen_xml2qbk 1.1.1, don't change, will be overwritten automatically]
15[/ Generated from doxy/doxygen_output/xml/group__discrete__frechet__distance.xml]
16[section:discrete_frechet_distance_3_with_strategy discrete_frechet_distance (with strategy)]
17
18'''<indexterm><primary>discrete_frechet_distance</primary></indexterm>'''
19Calculate discrete Frechet distance between two geometries (currently works for LineString-LineString) using specified strategy.
20
21[heading Synopsis]
22``template<typename Geometry1, typename Geometry2, typename Strategy>
23distance_result< typename point_type<Geometry1>::type, typename point_type<Geometry2>::type, Strategy >::type discrete_frechet_distance(Geometry1 const & geometry1, Geometry2 const & geometry2, Strategy const & strategy)``
24
25[heading Parameters]
26
27[table
28[[Type] [Concept] [Name] [Description] ]
29[[Geometry1 const &] [Any type fulfilling a Geometry Concept ] [geometry1] [Input geometry ]]
30[[Geometry2 const &] [Any type fulfilling a Geometry Concept ] [geometry2] [Input geometry ]]
31[[Strategy const &] [A type fulfilling a DistanceStrategy concept ] [strategy] [Distance strategy to be used to calculate Pt-Pt distance]]
32]
33
34
35[heading Header]
36Either
37
38`#include <boost/geometry.hpp>`
39
40
41Or
42
43`#include <boost/geometry/algorithms/discrete_frechet_distance.hpp>`
44
45[include reference/algorithms/discrete_frechet_distance.qbk]
46[heading Available Strategies]
47* [link geometry.reference.strategies.strategy_distance_pythagoras Pythagoras (cartesian)]
48* [link geometry.reference.strategies.strategy_distance_haversine Haversine (spherical)]
49[/ * more (currently extensions): Vincenty, Andoyer (geographic) ]
50
51[heading Example]
52[discrete_frechet_distance_strategy]
53[discrete_frechet_distance_strategy_output]
54
55
56[endsect]
57
58[section:discrete_frechet_distance_2 discrete_frechet_distance]
59
60'''<indexterm><primary>discrete_frechet_distance</primary></indexterm>'''
61Calculate discrete Frechet distance between two geometries (currently work for LineString-LineString).
62
63[heading Synopsis]
64``template<typename Geometry1, typename Geometry2>
65distance_result< typename point_type<Geometry1>::type, typename point_type<Geometry2>::type >::type discrete_frechet_distance(Geometry1 const & geometry1, Geometry2 const & geometry2)``
66
67[heading Parameters]
68
69[table
70[[Type] [Concept] [Name] [Description] ]
71[[Geometry1 const &] [Any type fulfilling a Geometry Concept ] [geometry1] [Input geometry ]]
72[[Geometry2 const &] [Any type fulfilling a Geometry Concept ] [geometry2] [Input geometry]]
73]
74
75
76[heading Header]
77Either
78
79`#include <boost/geometry.hpp>`
80
81
82Or
83
84`#include <boost/geometry/algorithms/discrete_frechet_distance.hpp>`
85
86[include reference/algorithms/discrete_frechet_distance.qbk]
87[heading Example]
88[discrete_frechet_distance]
89[discrete_frechet_distance_output]
90
91
92[endsect]
93
94