close-paving 0.1__tar.gz

close_paving-0.1/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

close_paving-0.1/PKG-INFO

@@ -0,0 +1,105 @@
+Metadata-Version: 2.4
+Name: close-paving
+Version: 0.1
+Summary: toolkit for hexagonal grid
+Home-page: https://gitee.com/hoops/close-paving
+Author: A.Star
+Author-email: astar@snowland.ltd
+Maintainer: A.Star
+Maintainer-email: astar@snowland.ltd
+License: Apache v2.0
+Platform: all
+Classifier: Operating System :: OS Independent
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python
+Classifier: Programming Language :: Python :: Implementation
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Software Development :: Libraries
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: astartool>=0.1
+Requires-Dist: numpy
+Requires-Dist: matplotlib
+Dynamic: author
+Dynamic: author-email
+Dynamic: classifier
+Dynamic: description
+Dynamic: description-content-type
+Dynamic: home-page
+Dynamic: license
+Dynamic: license-file
+Dynamic: maintainer
+Dynamic: maintainer-email
+Dynamic: platform
+Dynamic: requires-dist
+Dynamic: summary
+
+# honeycomb
+
+#### Description
+
+Hexagonal Grid.
+
+#### Software Architecture
+Software architecture description
+
+- core
+- kernel
+- plot_helper
+
+
+#### Installation
+
+1.  Pypi
+```commandline
+python install close-paving
+```
+
+2.  Source code
+
+- clone repo
+```commandline
+git clone https://gitcode.net/astar/a.star/close-paving.git
+```
+
+or 
+
+```commandline
+git clone https://gitee.com/hoops/close-paving.git
+```
+
+- cd close_paving
+```commandline
+cd close_paving
+```
+- download requirements.txt
+```commandline
+pip install -r requirements.txt
+```
+- run commandline
+```commandline
+python setup.py install
+```
+
+
+
+#### how to use
+
+![direction type](./docs/images/direction.png)
+
+
+
+#### contribute
+
+1.  Fork repo
+2.  create feature `Feat_xxx`
+3.  commit 
+4.  create `Pull Request`
+

close_paving-0.1/README.md

@@ -0,0 +1,79 @@
+# close-paving
+
+[![version](https://img.shields.io/pypi/v/close-paving.svg)](https://pypi.python.org/pypi/close-paving)
+[![gitee](https://gitee.com/hoops/close-paving/badge/star.svg)](https://gitee.com/snowlandltd/close-paving/stargazers)
+[![download](https://img.shields.io/pypi/dm/close-paving.svg)](https://pypi.org/project/close-paving)
+[![wheel](https://img.shields.io/pypi/wheel/close-paving.svg)](https://pypi.python.org/pypi/close-paving)
+![licence](https://img.shields.io/pypi/l/close-paving.svg)
+![status](https://img.shields.io/pypi/status/close-paving.svg)
+
+
+#### 介绍
+
+一个简单实用的六角形网格实现
+
+#### 软件架构
+软件架构说明
+
+- core
+- error
+- kernel
+- plot_helper
+- test
+
+
+#### 安装教程
+
+1.  pypi安装
+```commandline
+python install close-paving
+```
+
+2.  源码安装
+
+- 克隆仓库
+```commandline
+git clone https://gitcode.net/astar/a.star/close-paving.git
+```
+
+或者
+
+```commandline
+git clone https://gitee.com/hoops/close-paving.git
+```
+
+
+
+- 跳转目录
+```commandline
+cd close_paving
+```
+- 下载依赖
+```commandline
+pip install -r requirements.txt
+```
+
+
+
+
+
+- 运行安装命令
+```commandline
+python setup.py install
+```
+
+
+
+#### 使用说明
+
+
+![direction type](./docs/images/direction.png)
+
+
+#### 参与贡献
+
+1.  Fork 本仓库
+2.  新建 Feat_xxx 分支
+3.  提交代码
+4.  新建 Pull Request
+

close_paving-0.1/close_paving/__init__.py

@@ -0,0 +1,17 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+# @Author: A.Star
+# @contact: astar@snowland.ltd
+# @site: www.astar.ltd
+# @file: __init__.py.py
+# @time: 2021/7/1115:16
+# @Software: PyCharm
+
+
+__author__ = 'A.Star'
+
+from astartool.setuptool import get_version
+
+version = (0, 1, 0, 'final', 0)
+
+__version__ = get_version(version)

close_paving-0.1/close_paving/core/cell.py

@@ -0,0 +1,7 @@
+
+from abc import ABCMeta
+
+
+class Cell(metaclass=ABCMeta):
+    def __init__(self, *args, **kwargs):
+        pass

close_paving-0.1/close_paving/core/direction.py

@@ -0,0 +1,17 @@
+
+
+class Direction:
+    vertical = 0
+    horizontal = 1
+    left_left = 0
+    left_right = 2
+    right_left = 4
+    right_right = 6
+
+def get_direction_tuple(direction: int) -> tuple[int, int]:
+    """
+    获得Direction元祖
+    :param direction:
+    :return:
+    """
+    return direction & 1, direction & 6

close_paving-0.1/close_paving/core/hexagon.py

@@ -0,0 +1,54 @@
+from typing import List, Tuple, Union
+
+import numpy as np
+
+from close_paving.core.cell import Cell
+from close_paving.core.direction import Direction
+
+
+class Hexagon(Cell):
+    def __init__(self, center: Union[List[float], np.ndarray, Tuple[float]] = (0, 0),
+                 radius: float = 0.0,
+                 direction=Direction.horizontal, **kwargs):
+        assert radius >= 0
+        super().__init__()
+        self.center = np.array(center)
+        self.radius = radius
+        self.direction = direction
+        self.__dict__.update(kwargs)
+
+    @property
+    def points(self):
+        if self.direction == Direction.vertical:
+            half_r = self.radius / 2
+            root3_half_r = np.sqrt(3) * half_r
+            x1, x2, x3, x4, x5, x6 = -root3_half_r, 0, root3_half_r, root3_half_r, 0, -root3_half_r
+            y1, y2, y3, y4, y5, y6 = -half_r, -self.radius, -half_r, half_r, self.radius, half_r
+
+            delta = np.vstack([
+                [x1, y1], [x2, y2], [x3, y3], [x4, y4], [x5, y5], [x6, y6], [x1, y1]
+            ])
+            center = np.vstack([self.center] * 7)
+            return center + delta
+        else:
+            half_r = self.radius / 2
+            root3_half_r = np.sqrt(3) * half_r
+            x1, x2, x3, x4, x5, x6 = -half_r, half_r, self.radius, half_r, -half_r, -self.radius
+            y1, y2, y3, y4, y5, y6 = -root3_half_r, -root3_half_r, 0, root3_half_r, root3_half_r, 0
+            delta = np.vstack([
+                [x1, y1], [x2, y2], [x3, y3], [x4, y4], [x5, y5], [x6, y6], [x1, y1]
+            ])
+            center = np.vstack([self.center] * 7)
+            return center + delta
+
+
+class HorizontalHexagon(Hexagon):
+    def __init__(self, center: Union[List[float], np.ndarray, Tuple[float]] = (0, 0),
+                 radius: float = 0.0):
+        super().__init__(center, radius, direction=Direction.horizontal)
+
+
+class VerticalHexagon(Hexagon):
+    def __init__(self, center: Union[List[float], np.ndarray, Tuple[float]] = (0, 0),
+                 radius: float = 0.0):
+        super().__init__(center, radius, direction=Direction.vertical)

close_paving-0.1/close_paving/core/hexagonal_grid.py

@@ -0,0 +1,414 @@
+import itertools
+from typing import List, Tuple, Union, Dict, Iterable
+
+import numpy as np
+from astartool.error import ParameterTypeError, ParameterValueError
+
+from close_paving.core.cell import Cell
+from close_paving.core.direction import Direction, get_direction_tuple
+from close_paving.error import TypeNotAllowedError
+
+npl = np.linalg
+
+SQRT3 = np.sqrt(3)
+
+
+class HexagonGrid:
+    def __init__(self, seed: Union[List[float], np.ndarray, Tuple[float]] = (0, 0),
+                 radius: float = 0.0,
+                 shape: Tuple[int, int] = (0, 0),
+                 direction=Direction.vertical | Direction.left_right,
+                 value_list: Dict[str, Union[np.ndarray, list]] = None):
+        self.seed = np.array(seed)
+        self.radius = radius
+        self.shape = shape
+        self.direction = direction
+        if value_list is None:
+            self.value_dict = None
+        elif isinstance(value_list, dict):
+            self.value_dict = value_list
+        elif isinstance(value_list, np.ndarray):
+            self.value_dict = {"value": value_list}
+        else:
+            raise ParameterTypeError("Type of `value_list` must be list or np.ndarray.")
+
+    def to_cells(self, class_type=Cell, *args, **kwargs):
+        """
+        获取元胞矩阵
+        :param class_type: 元胞类型
+        :param args:
+        :param kwargs:
+        :return:
+        """
+        half_radius = self.radius / 2
+        one_and_a_half_radius = half_radius + self.radius
+        root3_radius = SQRT3 * self.radius
+        root3_half_radius = root3_radius / 2
+        x = np.empty(shape=self.shape)
+        y = np.empty(shape=self.shape)
+        direction_tuple = get_direction_tuple(self.direction)
+        direction = direction_tuple[0]
+        if direction == Direction.horizontal:
+            if direction_tuple[1] == Direction.right_right:
+                xi = self.seed[0] + one_and_a_half_radius * np.arange(self.shape[0])
+                x = np.repeat(np.expand_dims(xi, 1), self.shape[1], axis=1)
+                yi = self.seed[1] + root3_radius * np.arange(self.shape[1])
+                for col in range(0, self.shape[0]):
+                    y[col, :] = yi - root3_half_radius * col
+            elif direction_tuple[1] == Direction.right_left:
+                xi = self.seed[0] + one_and_a_half_radius * np.arange(self.shape[0])
+                x = np.repeat(np.expand_dims(xi, 1), self.shape[1], axis=1)
+                yi = self.seed[1] + root3_radius * np.arange(self.shape[1])
+                yii = yi - root3_half_radius
+                for col in range(0, self.shape[0], 2):
+                    y[col, :] = yi
+                for col in range(1, self.shape[0], 2):
+                    y[col, :] = yii
+            elif direction_tuple[1] == Direction.left_right:
+                xi = self.seed[0] + one_and_a_half_radius * np.arange(self.shape[0])
+                x = np.repeat(np.expand_dims(xi, 1), self.shape[1], axis=1)
+                yi = self.seed[1] + root3_radius * np.arange(self.shape[1])
+                yii = yi + root3_half_radius
+                for col in range(0, self.shape[0], 2):
+                    y[col, :] = yi
+                for col in range(1, self.shape[0], 2):
+                    y[col, :] = yii
+            elif direction_tuple[1] == Direction.left_left:
+                xi = self.seed[0] + one_and_a_half_radius * np.arange(self.shape[0])
+                x = np.repeat(np.expand_dims(xi, 1), self.shape[1], axis=1)
+                yi = self.seed[1] + root3_radius * np.arange(self.shape[1])
+                for col in range(0, self.shape[0]):
+                    y[col, :] = yi + root3_half_radius * col
+            else:
+                raise ParameterValueError("Value of `direction` is unknown")
+        else:
+            if direction_tuple[1] == Direction.right_right:
+                xi = self.seed[0] + root3_radius * np.arange(self.shape[0])
+                for row in range(0, self.shape[1]):
+                    x[:, row] = xi + root3_half_radius * row
+                yi = self.seed[1] + one_and_a_half_radius * np.arange(self.shape[1])
+                y = np.repeat(yi.reshape((1, -1)), self.shape[0], axis=0)
+            elif direction_tuple[1] == Direction.right_left:
+                xi = self.seed[0] + root3_radius * np.arange(self.shape[0])
+                xii = xi + root3_half_radius
+                for row in range(0, self.shape[1], 2):
+                    x[:, row] = xi
+                for row in range(1, self.shape[1], 2):
+                    x[:, row] = xii
+                yi = self.seed[1] + one_and_a_half_radius * np.arange(self.shape[1])
+                y = np.repeat(yi.reshape((1, -1)), self.shape[0], axis=0)
+            elif direction_tuple[1] == Direction.left_right:
+                xi = self.seed[0] + root3_radius * np.arange(self.shape[0])
+                xii = xi - root3_half_radius
+                for row in range(0, self.shape[1], 2):
+                    x[:, row] = xi
+                for row in range(1, self.shape[1], 2):
+                    x[:, row] = xii
+                yi = self.seed[1] + one_and_a_half_radius * np.arange(self.shape[1])
+                y = np.repeat(yi.reshape((1, -1)), self.shape[0], axis=0)
+            elif direction_tuple[1] == Direction.left_left:
+                xi = self.seed[0] + root3_radius * np.arange(self.shape[0])
+                for row in range(0, self.shape[1]):
+                    x[:, row] = xi - root3_half_radius * row
+                yi = self.seed[1] + one_and_a_half_radius * np.arange(self.shape[1])
+                y = np.repeat(yi.reshape((1, -1)), self.shape[0], axis=0)
+            else:
+                raise ParameterValueError("Value of `direction` is unknown")
+        if self.value_dict is None:
+            return [
+                [class_type(center=(x[i, j], y[i, j]), radius=self.radius, direction=direction, *args, **kwargs) for j
+                 in range(self.shape[1])] for i in range(self.shape[0])]
+        else:
+            return [[class_type(center=(x[i, j], y[i, j]), radius=self.radius, direction=direction, *args,
+                                **{k: v[i][j] for k, v in self.value_dict.items()}) for j in
+                     range(self.shape[1])] for i in range(self.shape[0])]
+
+    def filter_index(self, indexes: Iterable[Tuple[int, int]]):
+        """
+        按元胞形状过滤异常的索引, 异常的坐标将返回None
+        :param indexes:
+        :return:
+        """
+        return [(index if (0 <= index[0] < self.shape[0]) and (0 <= index[1] < self.shape[1]) else None) for index in
+                indexes]
+
+    def get_distance(self, src_index, dst_index):
+        """
+        返回两坐标之间的距离
+        :param src_index:
+        :param dst_index:
+        :return:
+        """
+        src_index = tuple(src_index)
+        dst_index = tuple(dst_index)
+        if not (0 <= src_index[0] < self.shape[0]):
+            raise ParameterValueError("src_index is out of bounds")
+
+        if not (0 <= src_index[1] < self.shape[1]):
+            raise ParameterValueError("src_index is out of bounds")
+
+        if not (0 <= dst_index[0] < self.shape[0]):
+            raise ParameterValueError("dst_index is out of bounds")
+
+        if not (0 <= dst_index[1] < self.shape[1]):
+            raise ParameterValueError("dst_index is out of bounds")
+
+        direction_tuple = get_direction_tuple(self.direction)
+        direction = direction_tuple[1]
+        if direction_tuple[0] == Direction.vertical:
+            if direction == Direction.left_left:
+                if dst_index[1] > src_index[1]:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = src_index[0]
+                    bound_high = min(src_index[0] + height_delta, self.shape[0] - 1)
+                else:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = max(src_index[0] - height_delta, 0)
+                    bound_high = src_index[0]
+
+                if dst_index[0] < bound_low:
+                    return height_delta + bound_low - dst_index[0]
+                elif bound_low <= dst_index[0] <= bound_high:
+                    return height_delta
+                else:
+                    return height_delta + dst_index[0] - bound_high
+
+            elif direction == Direction.left_right:
+                src_col_is_odd = src_index[1] % 2
+                dst_col_is_odd = dst_index[1] % 2
+                if dst_index[1] > src_index[1]:
+                    delta = (dst_index[1] - src_index[1]) // 2
+                else:
+                    delta = - (dst_index[1] - src_index[1]) // 2
+                if src_col_is_odd and dst_col_is_odd:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = src_index[0] - delta
+                    bound_high = src_index[0] + delta
+                    if bound_low <= dst_index[0] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[0]), abs(dst_index[0] - bound_high))
+                elif src_col_is_odd and not dst_col_is_odd:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = src_index[0] - delta - 1
+                    bound_high = src_index[0] + delta
+                    if bound_low <= dst_index[0] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[0]), abs(dst_index[0] - bound_high))
+
+
+                elif not src_col_is_odd and dst_col_is_odd:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    if dst_index[1] < src_index[1]:
+                        bound_low = max(0, src_index[0] - delta)
+                        bound_high = min(src_index[0] + delta + 1, self.shape[0] - 1)
+                    else:
+                        bound_low = max(0, src_index[0] - delta)
+                        bound_high = min(src_index[0] + delta + 1, self.shape[0] - 1)
+
+                    if bound_low <= dst_index[0] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[0]), abs(dst_index[0] - bound_high))
+                else:
+                    # not src_col_is_odd and not dst_col_is_odd
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = src_index[0] - delta
+                    bound_high = src_index[0] + delta
+                    if bound_low <= dst_index[0] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[0]), abs(dst_index[0] - bound_high))
+            elif direction == Direction.right_left:
+                src_col_is_odd = src_index[1] % 2
+                dst_col_is_odd = dst_index[1] % 2
+                if dst_index[1] > src_index[1]:
+                    delta = (dst_index[1] - src_index[1]) // 2
+                else:
+                    delta = - (dst_index[1] - src_index[1]) // 2
+                if src_col_is_odd and dst_col_is_odd:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = src_index[0] - delta
+                    bound_high = src_index[0] + delta
+                    if bound_low <= dst_index[0] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[0]), abs(dst_index[0] - bound_high))
+                elif src_col_is_odd and not dst_col_is_odd:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = src_index[0] - delta
+                    bound_high = src_index[0] + delta + 1
+                    if bound_low <= dst_index[0] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[0]), abs(dst_index[0] - bound_high))
+
+
+                elif not src_col_is_odd and dst_col_is_odd:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = max(0, src_index[0] - delta - 1)
+                    bound_high = min(src_index[0] + delta, self.shape[0] - 1)
+                    if bound_low <= dst_index[0] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[0]), abs(dst_index[0] - bound_high))
+                else:
+                    # not src_col_is_odd and not dst_col_is_odd
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = src_index[0] - delta
+                    bound_high = src_index[0] + delta
+                    if bound_low <= dst_index[0] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[0]), abs(dst_index[0] - bound_high))
+            elif direction == Direction.right_right:
+                if dst_index[1] > src_index[1]:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = max(src_index[0] - height_delta, 0)
+                    bound_high = src_index[0]
+                else:
+                    height_delta = abs(dst_index[1] - src_index[1])
+                    bound_low = src_index[0]
+                    bound_high = min(src_index[0] + height_delta, self.shape[0])
+
+                if bound_low <= dst_index[0] <= bound_high:
+                    return height_delta
+                else:
+                    return height_delta + min(abs(bound_low - dst_index[0]), abs(dst_index[0] - bound_high))
+            else:
+                raise TypeNotAllowedError(
+                    "`direction` must be in (Direction.left_left, Direction.left_right, Direction.right_left, Direction.right_right)")
+        else:
+            if direction == Direction.left_left:
+                delta = dst_index[0] - src_index[0]
+                if delta >= 0:
+                    bound_low = max(0, src_index[1] - delta)
+                    bound_high = src_index[1]
+                else:
+                    delta = -delta
+                    bound_low = src_index[1]
+                    bound_high = min(self.shape[1] - 1, src_index[1] + delta)
+                if dst_index[1] < bound_low:
+                    return delta + bound_low - dst_index[1]
+                elif bound_low <= dst_index[1] <= bound_high:
+                    return delta
+                else:
+                    return delta + dst_index[1] - bound_high
+
+            elif direction == Direction.left_right:
+                src_col_is_odd = src_index[0] % 2
+                dst_col_is_odd = dst_index[0] % 2
+                if dst_index[0] > src_index[0]:
+                    delta = (dst_index[0] - src_index[0]) // 2
+                else:
+                    delta = - (dst_index[0] - src_index[0]) // 2
+                if src_col_is_odd and dst_col_is_odd:
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = src_index[1] - delta
+                    bound_high = src_index[1] + delta
+                    if bound_low <= dst_index[1] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[1]), abs(dst_index[1] - bound_high))
+                elif src_col_is_odd and not dst_col_is_odd:
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = src_index[1] - delta
+                    bound_high = src_index[1] + delta + 1
+                    if bound_low <= dst_index[1] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[1]), abs(dst_index[1] - bound_high))
+
+
+                elif not src_col_is_odd and dst_col_is_odd:
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = max(0, src_index[1] - delta - 1)
+                    bound_high = min(src_index[1] + delta, self.shape[1] - 1)
+
+                    if bound_low <= dst_index[1] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[1]), abs(dst_index[1] - bound_high))
+                else:
+                    # not src_col_is_odd and not dst_col_is_odd
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = src_index[1] - delta
+                    bound_high = src_index[1] + delta
+                    if bound_low <= dst_index[1] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[1]), abs(dst_index[1] - bound_high))
+            elif direction == Direction.right_left:
+                src_col_is_odd = src_index[0] % 2
+                dst_col_is_odd = dst_index[0] % 2
+                if dst_index[0] > src_index[0]:
+                    delta = (dst_index[0] - src_index[0]) // 2
+                else:
+                    delta = - (dst_index[0] - src_index[0]) // 2
+                if src_col_is_odd and dst_col_is_odd:
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = src_index[1] - delta
+                    bound_high = src_index[1] + delta
+                    if bound_low <= dst_index[1] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[1]), abs(dst_index[1] - bound_high))
+                elif src_col_is_odd and not dst_col_is_odd:
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = src_index[1] - delta - 1
+                    bound_high = src_index[1] + delta
+                    if bound_low <= dst_index[1] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[1]), abs(dst_index[1] - bound_high))
+
+                elif not src_col_is_odd and dst_col_is_odd:
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = max(0, src_index[1] - delta)
+                    bound_high = min(src_index[1] + delta + 1, self.shape[1] - 1)
+                    if bound_low <= dst_index[1] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[1]), abs(dst_index[1] - bound_high))
+                else:
+                    # not src_col_is_odd and not dst_col_is_odd
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = src_index[1] - delta
+                    bound_high = src_index[1] + delta
+                    if bound_low <= dst_index[1] <= bound_high:
+                        return height_delta
+                    else:
+                        return height_delta + min(abs(bound_low - dst_index[1]), abs(dst_index[1] - bound_high))
+            elif direction == Direction.right_right:
+
+                if dst_index[0] > src_index[0]:
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = src_index[1]
+                    bound_high = min(src_index[1] + height_delta, self.shape[1])
+                else:
+                    height_delta = abs(dst_index[0] - src_index[0])
+                    bound_low = max(0, src_index[1] - height_delta)
+                    bound_high = src_index[1]
+
+                if bound_low <= dst_index[1] <= bound_high:
+                    return height_delta
+                else:
+                    return height_delta + min(abs(bound_low - dst_index[1]), abs(dst_index[1] - bound_high))
+
+            else:
+                raise TypeNotAllowedError(
+                    "`direction` must be in (Direction.left_left, Direction.left_right, Direction.right_left, Direction.right_right)")
+
+    def neighbours(self, c, distance=1):
+        """
+        获取坐标c distance范围内的所有坐标
+        :param c:
+        :param distance:
+        :return:
+        """
+
+        bound_x = (max(0, c[0] - distance - 1), min(self.shape[0], c[0] + distance + 1))
+        bound_y = (max(0, c[1] - distance - 1), min(self.shape[1], c[1] + distance + 1))
+        return set(filter(lambda x: self.get_distance(x, c) <= distance,
+                          itertools.product(range(*bound_x), range(*bound_y)))) - {c}

close_paving-0.1/close_paving/error/__init__.py

@@ -0,0 +1,7 @@
+
+
+from astartool.error import ParameterValueError
+
+class TypeNotAllowedError(ParameterValueError):
+    def __init__(self, *args, **kwargs): # real signature unknown
+        super().__init__(*args)

close_paving-0.1/close_paving/kernel/__init__.py

@@ -0,0 +1,21 @@
+import numpy as np
+from close_paving.kernel.gen_kernel import gen_kernel
+
+npa = np.array
+
+vertical_left_left_kernel = npa([[1, 1, 0], [1, 1, 1], [0, 1, 1]])
+vertical_right_right_kernel = npa([[0, 1, 1], [1, 1, 1], [1, 1, 0]])
+
+vertical_left_right_kernel_odd = vertical_left_left_kernel
+vertical_left_right_kernel_even = vertical_right_right_kernel
+vertical_right_left_kernel_odd = vertical_right_right_kernel
+vertical_right_left_kernel_even = vertical_left_left_kernel
+
+
+horizontal_left_left_kernel = npa([[0, 1, 1], [1, 1, 1], [1, 1, 0]])
+horizontal_right_right_kernel = npa([[1, 1, 0], [1, 1, 1], [0, 1, 1]])
+
+horizontal_left_right_kernel_odd = horizontal_left_left_kernel
+horizontal_left_right_kernel_even = horizontal_right_right_kernel
+horizontal_right_left_kernel_odd = horizontal_right_right_kernel
+horizontal_right_left_kernel_even = horizontal_left_left_kernel

close_paving-0.1/close_paving/kernel/gen_kernel.py

@@ -0,0 +1,54 @@
+from close_paving.core.direction import Direction
+from close_paving.core.direction import get_direction_tuple
+
+import numpy as np
+from astartool.error import ParameterValueError
+from close_paving.error import TypeNotAllowedError
+
+__all__ = [
+    'gen_kernel'
+]
+
+
+def gen_kernel(size=3, kernel_type=Direction.left_left | Direction.vertical):
+    """
+
+    :param kernel_type:
+    :return:
+    """
+    if size <= 0 or size & 2 == 0:
+        raise ParameterValueError("Parameter `size` must be a positive odd number.")
+    direction_tuple = get_direction_tuple(kernel_type)
+    direction = direction_tuple[1]
+    kernel = np.eye(size)
+    if direction_tuple[0] == Direction.vertical:
+        if direction == Direction.left_left:
+            for i in range(size // 2):
+                kernel += np.diag(np.ones(size - i - 1), k=i + 1)
+                kernel += np.diag(np.ones(size - i - 1), k=-i - 1)
+        elif direction == Direction.left_right:
+            raise TypeNotAllowedError("kernel_type must be in (Direction.left_left, Direction.right_right).")
+        elif direction == Direction.right_left:
+            raise TypeNotAllowedError("kernel_type must be in (Direction.left_left, Direction.right_right).")
+        elif direction == Direction.right_right:
+            for i in range(size // 2):
+                kernel += np.diag(np.ones(size - i - 1), k=i + 1)
+                kernel += np.diag(np.ones(size - i - 1), k=-i - 1)
+            kernel = kernel[::-1]
+
+    else:
+        kernel = np.eye(size)
+        if direction == Direction.left_left:
+            for i in range(size // 2):
+                kernel += np.diag(np.ones(size - i - 1), k=i + 1)
+                kernel += np.diag(np.ones(size - i - 1), k=-i - 1)
+            kernel = kernel[::-1]
+        elif direction == Direction.left_right:
+            raise TypeNotAllowedError("kernel_type must be in (Direction.left_left, Direction.right_right).")
+        elif direction == Direction.right_left:
+            raise TypeNotAllowedError("kernel_type must be in (Direction.left_left, Direction.right_right).")
+        elif direction == Direction.right_right:
+            for i in range(size // 2):
+                kernel += np.diag(np.ones(size - i - 1), k=i + 1)
+                kernel += np.diag(np.ones(size - i - 1), k=-i - 1)
+    return kernel

close_paving-0.1/close_paving/plot_helper/__init__.py

@@ -0,0 +1,2 @@
+# -*- coding: utf-8 -*-
+

close_paving-0.1/close_paving/plot_helper/plot_helper.py

@@ -0,0 +1,37 @@
+# -*- coding: utf-8 -*-
+
+
+import numpy as np
+
+from close_paving.core.cell import Cell
+from close_paving.core.hexagon import Hexagon
+from close_paving.core.hexagonal_grid import HexagonGrid
+from matplotlib import pylab as plt
+
+
+def plot_hexagon(hexagon: Hexagon, *args, handler=plt, **kwargs):
+    """
+    绘制六角形
+    :param hexagon:
+    :param args:
+    :param handler:
+    :param kwargs:
+    :return:
+    """
+    points = hexagon.points
+    handler.plot(points[:, 0], points[:, 1], *args, **kwargs)
+
+
+def plot_hexagonal_grid(hexagon_grid: HexagonGrid, *args, handler=plt, **kwargs):
+    """
+    绘制六角形网络
+    :param hexagon_grid:
+    :param args:
+    :param handler:
+    :param kwargs:
+    :return:
+    """
+    cell_list = hexagon_grid.to_cells(Hexagon)
+    for row_cells in cell_list:
+        for hexagon in row_cells:
+            plot_hexagon(hexagon, handler=handler, *args, **kwargs)

close_paving-0.1/close_paving.egg-info/PKG-INFO

@@ -0,0 +1,105 @@
+Metadata-Version: 2.4
+Name: close-paving
+Version: 0.1
+Summary: toolkit for hexagonal grid
+Home-page: https://gitee.com/hoops/close-paving
+Author: A.Star
+Author-email: astar@snowland.ltd
+Maintainer: A.Star
+Maintainer-email: astar@snowland.ltd
+License: Apache v2.0
+Platform: all
+Classifier: Operating System :: OS Independent
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python
+Classifier: Programming Language :: Python :: Implementation
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Software Development :: Libraries
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: astartool>=0.1
+Requires-Dist: numpy
+Requires-Dist: matplotlib
+Dynamic: author
+Dynamic: author-email
+Dynamic: classifier
+Dynamic: description
+Dynamic: description-content-type
+Dynamic: home-page
+Dynamic: license
+Dynamic: license-file
+Dynamic: maintainer
+Dynamic: maintainer-email
+Dynamic: platform
+Dynamic: requires-dist
+Dynamic: summary
+
+# honeycomb
+
+#### Description
+
+Hexagonal Grid.
+
+#### Software Architecture
+Software architecture description
+
+- core
+- kernel
+- plot_helper
+
+
+#### Installation
+
+1.  Pypi
+```commandline
+python install close-paving
+```
+
+2.  Source code
+
+- clone repo
+```commandline
+git clone https://gitcode.net/astar/a.star/close-paving.git
+```
+
+or 
+
+```commandline
+git clone https://gitee.com/hoops/close-paving.git
+```
+
+- cd close_paving
+```commandline
+cd close_paving
+```
+- download requirements.txt
+```commandline
+pip install -r requirements.txt
+```
+- run commandline
+```commandline
+python setup.py install
+```
+
+
+
+#### how to use
+
+![direction type](./docs/images/direction.png)
+
+
+
+#### contribute
+
+1.  Fork repo
+2.  create feature `Feat_xxx`
+3.  commit 
+4.  create `Pull Request`
+

close_paving-0.1/close_paving.egg-info/SOURCES.txt

@@ -0,0 +1,19 @@
+LICENSE
+README.md
+setup.py
+close_paving/__init__.py
+close_paving.egg-info/PKG-INFO
+close_paving.egg-info/SOURCES.txt
+close_paving.egg-info/dependency_links.txt
+close_paving.egg-info/requires.txt
+close_paving.egg-info/top_level.txt
+close_paving/core/__init__.py
+close_paving/core/cell.py
+close_paving/core/direction.py
+close_paving/core/hexagon.py
+close_paving/core/hexagonal_grid.py
+close_paving/error/__init__.py
+close_paving/kernel/__init__.py
+close_paving/kernel/gen_kernel.py
+close_paving/plot_helper/__init__.py
+close_paving/plot_helper/plot_helper.py

close_paving-0.1/close_paving.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

close_paving-0.1/close_paving.egg-info/requires.txt

@@ -0,0 +1,3 @@
+astartool>=0.1
+numpy
+matplotlib

close_paving-0.1/close_paving.egg-info/top_level.txt

@@ -0,0 +1 @@
+close_paving

close_paving-0.1/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

close_paving-0.1/setup.py

@@ -0,0 +1,50 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+# @Author  : A.Star
+# @contact: astar@snowland.ltd
+# @site: www.snowland.ltd
+# @file: setup.py
+# @time: 2025/10/8 23:31
+# @Software: PyCharm
+
+
+import os
+from setuptools import find_packages
+from close_paving import version
+from astartool.setuptool import load_install_requires, get_version, setup, read_file
+
+osp = os.path
+
+setup(
+    name='close-paving',
+    version=get_version(version),
+    description=(
+        'toolkit for hexagonal grid'
+    ),
+    long_description=read_file('README.en.md', encoding='utf-8'),
+    long_description_content_type='text/markdown',
+    author='A.Star',
+    author_email='astar@snowland.ltd',
+    maintainer='A.Star',
+    maintainer_email='astar@snowland.ltd',
+    license='Apache v2.0',
+    packages=find_packages(),
+    platforms=["all"],
+    url='https://gitee.com/hoops/close-paving',
+    classifiers=[
+        'Operating System :: OS Independent',
+        'Intended Audience :: Science/Research',
+        'Programming Language :: Python',
+        'Programming Language :: Python :: Implementation',
+        'Programming Language :: Python :: 3',
+        'Programming Language :: Python :: 3.7',
+        'Programming Language :: Python :: 3.8',
+        'Programming Language :: Python :: 3.9',
+        'Programming Language :: Python :: 3.10',
+        'Programming Language :: Python :: 3.11',
+        'Programming Language :: Python :: 3.12',
+        'Programming Language :: Python :: 3.13',
+        'Topic :: Software Development :: Libraries'
+    ],
+    install_requires=load_install_requires()
+)