A tool for studying the nodal features of potential lanscapes.
Project description
The goal of this code is to identify nodal features in potential landscapes, using a two-step approach:
Search: Starting from a grid of starting points, find an initial set of nodal points by using a minimization scheme (Nelder-Mead). The initial set of nodes can be further refined by searching in their vicinity. This should produce a point cloud which lies densely within the nodal features to be discovered.
Identification: Identify the features (points, lines, surfaces) which are contained in the point cloud. For this step, the nodal points are first separated into clusters. For each cluster, the dimension is estimated, and depending on the points are evaluated further.
The initial use-case for this code is to find gapless features in three-dimensional materials.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
File details
Details for the file nodefinder-0.1.0.tar.gz.
File metadata
- Download URL: nodefinder-0.1.0.tar.gz
- Upload date:
- Size: 33.4 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/1.11.0 pkginfo/1.4.2 requests/2.18.4 setuptools/39.2.0 requests-toolbelt/0.8.0 tqdm/4.22.0 CPython/3.6.7
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 935f5353510f4c64d7aec321a20eb897e327fd5d8371fb70fa26c21b1586351b |
|
| MD5 | 94d64f6945af0c060f3fe9fec5d32273 |
|
| BLAKE2b-256 | 81bfca1436dec097379e56ef72fcbe7ca87a92fb89289f539daf5cf242e6eb6f |
