1%feature("docstring") OT::NaiveEnclosingSimplex
2"Naive implementation of point location.
3
4This class implements a naive implementation of point location,
5by looking into all its simplices.  It works well for convex
6domains, but may be slow otherwise.
7
8Available constructors:
9    NaiveEnclosingSimplex(*vertices, simplices*)
10
11Parameters
12----------
13vertices : :class:`~openturns.Sample`
14    Vertices.
15
16simplices : :class:`~openturns.IndicesCollection`
17    Simplices.
18
19Notes
20-----
21
22In order to speed-up point location, a first pass is performed
23by looping over all simplices containing the nearest point.  If
24query point is not found in those simplices, then all simplices
25are looked for.
26
27See also
28--------
29EnclosingSimplexAlgorithm
30
31Examples
32--------
33>>> import openturns as ot
34>>> mesher = ot.IntervalMesher([5, 10])
35>>> lowerbound = [0.0, 0.0]
36>>> upperBound = [2.0, 4.0]
37>>> interval = ot.Interval(lowerbound, upperBound)
38>>> mesh = mesher.build(interval)
39>>> locator = ot.NaiveEnclosingSimplex(mesh.getVertices(), mesh.getSimplices())
40>>> simplex = locator.query([0.1, 0.2])"
41
42// ---------------------------------------------------------------------
43
44%feature("docstring") OT::NaiveEnclosingSimplex::getNearestNeighbourAlgorithm
45"Accessor to the nearest neighbour algorithm.
46
47Returns
48-------
49nearestNeighbour : :class:`~openturns.NearestNeighbourAlgorithm`
50    Algorithm used during first pass to locate the nearest point."
51
52// ---------------------------------------------------------------------
53
54%feature("docstring") OT::NaiveEnclosingSimplex::setNearestNeighbourAlgorithm
55"Accessor to the nearest neighbour algorithm.
56
57Parameters
58----------
59nearestNeighbour : :class:`~openturns.NearestNeighbourAlgorithm`
60    Algorithm to use during first pass to locate the nearest point."
61
62