Na}{

File Content: `init.cpython-35.pyc`



DB�W6������������������@���s����d��Z��d�d�l�m�Z�m�Z�m�Z�d�d�l�Td�d�l�Td�d�l�Td�d�l�m	�Z	�d�d�l
�Td�d�l�m�Z�d�d����e
����D��Z�e�d	�g�7Z�d�d
�l�m�Z�d�d�l�m�Z�e����j�Z�e����j�Z�d�S)
a�
��
=============================================================
Spatial algorithms and data structures (:mod:`scipy.spatial`)
=============================================================

.. currentmodule:: scipy.spatial

Nearest-neighbor Queries
========================
.. autosummary::
   :toctree: generated/

   KDTree      -- class for efficient nearest-neighbor queries
   cKDTree     -- class for efficient nearest-neighbor queries (faster impl.)
   distance    -- module containing many different distance measures
   Rectangle

Delaunay Triangulation, Convex Hulls and Voronoi Diagrams
=========================================================

.. autosummary::
   :toctree: generated/

   Delaunay    -- compute Delaunay triangulation of input points
   ConvexHull  -- compute a convex hull for input points
   Voronoi     -- compute a Voronoi diagram hull from input points
   SphericalVoronoi -- compute a Voronoi diagram from input points on the surface of a sphere

Plotting Helpers
================

.. autosummary::
   :toctree: generated/

   delaunay_plot_2d     -- plot 2-D triangulation
   convex_hull_plot_2d  -- plot 2-D convex hull
   voronoi_plot_2d      -- plot 2-D voronoi diagram

.. seealso:: :ref:`Tutorial <qhulltutorial>`


Simplex representation
======================
The simplices (triangles, tetrahedra, ...) appearing in the Delaunay
tesselation (N-dim simplices), convex hull facets, and Voronoi ridges
(N-1 dim simplices) are represented in the following scheme::

    tess = Delaunay(points)
    hull = ConvexHull(points)
    voro = Voronoi(points)

    # coordinates of the j-th vertex of the i-th simplex
    tess.points[tess.simplices[i, j], :]        # tesselation element
    hull.points[hull.simplices[i, j], :]        # convex hull facet
    voro.vertices[voro.ridge_vertices[i, j], :] # ridge between Voronoi cells

For Delaunay triangulations and convex hulls, the neighborhood
structure of the simplices satisfies the condition:

    ``tess.neighbors[i,j]`` is the neighboring simplex of the i-th
    simplex, opposite to the j-vertex. It is -1 in case of no
    neighbor.

Convex hull facets also define a hyperplane equation::

    (hull.equations[i,:-1] * coord).sum() + hull.equations[i,-1] == 0

Similar hyperplane equations for the Delaunay triangulation correspond
to the convex hull facets on the corresponding N+1 dimensional
paraboloid.

The Delaunay triangulation objects offer a method for locating the
simplex containing a given point, and barycentric coordinate
computations.

Functions
---------

.. autosummary::
   :toctree: generated/

   tsearch
   distance_matrix
   minkowski_distance
   minkowski_distance_p
   procrustes

�����)�division�print_function�absolute_import����)�*)�SphericalVoronoi)�
procrustesc�������������C���s%���g��|��]�}�|�j��d����s�|���q�S)�_)�
startswith)�.0�s��r
����/__init__.py�
<listcomp>c���s���	�r����distance)r���)�TesterN)�__doc__Z
__future__r���r���r���ZkdtreeZckdtreeZqhullZ_spherical_voronoir���Z
_plotutilsZ_procrustesr����dir�__all__��r���Z
numpy.testingr���ZtestZbenchr
���r
���r
���r����<module>X���s���

Name	Size	Permission
__init__.cpython-35.opt-1.pyc	3439 bytes	0644
__init__.cpython-35.pyc	3439 bytes	0644
_plotutils.cpython-35.opt-1.pyc	5594 bytes	0644
_plotutils.cpython-35.pyc	5594 bytes	0644
_procrustes.cpython-35.opt-1.pyc	4295 bytes	0644
_procrustes.cpython-35.pyc	4295 bytes	0644
_spherical_voronoi.cpython-35.opt-1.pyc	12641 bytes	0644
_spherical_voronoi.cpython-35.pyc	12641 bytes	0644
distance.cpython-35.opt-1.pyc	60567 bytes	0644
distance.cpython-35.pyc	60567 bytes	0644
kdtree.cpython-35.opt-1.pyc	32602 bytes	0644
kdtree.cpython-35.pyc	32602 bytes	0644
setup.cpython-35.opt-1.pyc	3126 bytes	0644
setup.cpython-35.pyc	3126 bytes	0644

File Content: __init__.cpython-35.pyc

File Content: `init.cpython-35.pyc`