Metadata-Version: 2.1
Name: nglpy
Version: 1.1.7
Summary: A wrapper library for exposing the C++ neighborhood graph library (NGL) for computing empty region graphs to python
Author-email: Dan Maljovec <maljovec002@gmail.com>
Project-URL: Documentation, https://nglpy.readthedocs.io/en/latest/
Project-URL: Source, https://github.com/maljovec/nglpy
Keywords: geometry,neighborhood,empty region graph,neighborhood graph library,beta skeleton,relative neighbor,Gabriel graph
Classifier: Development Status :: 3 - Alpha
Classifier: Intended Audience :: Science/Research
Classifier: License :: OSI Approved :: BSD License
Classifier: Programming Language :: C++
Classifier: Programming Language :: Python :: 3
Classifier: Topic :: Scientific/Engineering :: Mathematics
Requires-Python: >=2.7, <4
Description-Content-Type: text/x-rst
License-File: LICENSE
Requires-Dist: scipy
Requires-Dist: numpy
Requires-Dist: scikit-learn
Requires-Dist: pyDOE
Requires-Dist: ghalton (<0.6.2)

=====
nglpy
=====

.. badges

.. image:: https://img.shields.io/pypi/v/nglpy.svg
        :target: https://pypi.python.org/pypi/nglpy
        :alt: Latest Version on PyPI
.. image:: https://img.shields.io/pypi/dm/nglpy.svg?label=PyPI%20downloads
        :target: https://pypi.org/project/nglpy/
        :alt: PyPI downloads

.. image:: https://github.com/maljovec/nglpy/actions/workflows/quality.yaml/badge.svg?branch=main
        :target: https://github.com/maljovec/nglpy/actions
        :alt: Code Quality Test Results
.. image:: https://github.com/maljovec/nglpy/actions/workflows/test.yaml/badge.svg?branch=main
        :target: https://github.com/maljovec/nglpy/actions
        :alt: Test Suite Results

.. image:: https://www.codefactor.io/repository/github/maljovec/nglpy/badge
        :target: https://www.codefactor.io/repository/github/maljovec/nglpy
        :alt: CodeFactor
.. image:: https://coveralls.io/repos/github/maljovec/nglpy/badge.svg?branch=main
        :target: https://coveralls.io/github/maljovec/nglpy?branch=main
        :alt: Coveralls
.. image:: https://readthedocs.org/projects/nglpy/badge/?version=latest
        :target: https://nglpy.readthedocs.io/en/latest/?badge=latest
        :alt: ReadTheDocs
.. image:: https://pyup.io/repos/github/maljovec/nglpy/shield.svg
        :target: https://pyup.io/repos/github/maljovec/nglpy/
        :alt: Pyup

.. image:: https://img.shields.io/badge/code%20style-black-000000.svg
        :target: https://github.com/psf/black
        :alt: This code is formatted in black
.. image:: https://img.shields.io/badge/%20imports-isort-%231674b1?style=flat&labelColor=ef8336
        :target: https://pycqa.github.io/isort/
        :alt: This code has its imports sorted with isort
.. image:: https://img.shields.io/badge/License-BSD_3--Clause-blue.svg
        :target: https://opensource.org/licenses/BSD-3-Clause
        :alt: BSD 3-Clause License

.. end_badges

.. logo

.. image:: docs/_static/nglpy.svg
    :align: center
    :alt: nglpy

.. end_logo

.. introduction

A Python wrapped version of the [Neighborhood Graph Library
(NGL_) developed by Carlos Correa and Peter Lindstrom.

.. _NGL: http://www.ngraph.org/

.. LONG_DESCRIPTION

Given a set of arbitrarily arranged points in any dimension, this library is
able to construct several different types of neighborhood graphs mainly focusing
on empty region graph algorithms such as the beta skeleton family of graphs.

.. END_LONG_DESCRIPTION

.. end_introduction

.. install

Installation
============

::

    pip install nglpy

.. end-install

.. usage

Usage
=====

Then you can use the library from python such as the example below::

    import nglpy
    import numpy as np

    point_set = np.random.rand(100,2)
    max_neighbors = 9
    beta = 1

    aGraph = nglpy.EmptyRegionGraph(max_neighbors=max_neighbors, relaxed=False, beta=beta)
    aGraph.build(point_set)

    aGraph.neighbors()

.. end-usage
