refactor: excel parse

2026-04-16 10:01:11 +08:00
parent 680ecc320f
commit f62f95ec02
7941 changed files with 2899112 additions and 0 deletions
@@ -0,0 +1,106 @@
+# Copyright (c) 2022-2024, Manfred Moitzi
+# License: MIT License
+from __future__ import annotations
+from typing import Iterable, Iterator, Sequence
+import ezdxf
+from ezdxf.math import Vec2, UVec, Vec3, safe_normal_vector, OCS
+
+from ._mapbox_earcut import earcut
+
+if ezdxf.options.use_c_ext:
+    try:
+        from ezdxf.acc.mapbox_earcut import earcut  # type: ignore
+    except ImportError:
+        pass
+
+__all__ = [
+    "mapbox_earcut_2d",
+    "mapbox_earcut_3d",
+]
+
+
+def mapbox_earcut_2d(
+    exterior: Iterable[UVec], holes: Iterable[Iterable[UVec]] | None = None
+) -> list[Sequence[Vec2]]:
+    """Mapbox triangulation algorithm with hole support for 2D polygons.
+
+    Implements a modified ear slicing algorithm, optimized by z-order
+    curve hashing and extended to handle holes, twisted polygons, degeneracies
+    and self-intersections in a way that doesn't guarantee correctness of
+    triangulation, but attempts to always produce acceptable results for
+    practical data.
+
+    Source: https://github.com/mapbox/earcut
+
+    Args:
+        exterior: exterior polygon as iterable of :class:`Vec2` objects
+        holes: iterable of holes as iterable of :class:`Vec2` objects, a hole
+            with single point represents a `Steiner point`_.
+
+    Returns:
+        yields the result as 3-tuples of :class:`Vec2` objects
+
+    .. _Steiner point: https://en.wikipedia.org/wiki/Steiner_point_(computational_geometry)
+
+    """
+    points = Vec2.list(exterior)
+    if len(points) == 0:
+        return []
+    holes_: list[list[Vec2]] = []
+    if holes:
+        holes_ = [Vec2.list(hole) for hole in holes]
+    return earcut(points, holes_)
+
+
+def mapbox_earcut_3d(
+    exterior: Iterable[UVec], holes: Iterable[Iterable[UVec]] | None = None
+) -> Iterator[Sequence[Vec3]]:
+    """Mapbox triangulation algorithm with hole support for flat 3D polygons.
+
+    Implements a modified ear slicing algorithm, optimized by z-order
+    curve hashing and extended to handle holes, twisted polygons, degeneracies
+    and self-intersections in a way that doesn't guarantee correctness of
+    triangulation, but attempts to always produce acceptable results for
+    practical data.
+
+    Source: https://github.com/mapbox/earcut
+
+    Args:
+        exterior: exterior polygon as iterable of :class:`Vec3` objects
+        holes: iterable of holes as iterable of :class:`Vec3` objects, a hole
+            with single point represents a `Steiner point`_.
+
+    Returns:
+        yields the result as 3-tuples of :class:`Vec3` objects
+
+    Raise:
+        TypeError: invalid input data type
+        ZeroDivisionError: normal vector calculation failed
+
+    """
+    polygon = Vec3.list(exterior)
+    if len(polygon) == 0:
+        return
+
+    if polygon[0].isclose(polygon[-1]):
+        polygon.pop()
+    count = len(polygon)
+    if count < 3:
+        return
+    if count == 3:
+        yield polygon[0], polygon[1], polygon[2]
+        return
+
+    ocs = OCS(safe_normal_vector(polygon))
+    elevation = ocs.from_wcs(polygon[0]).z
+    exterior_ocs = list(ocs.points_from_wcs(polygon))
+    holes_ocs: list[list[Vec3]] = []
+    if holes:
+        holes_ocs = [list(ocs.points_from_wcs(hole)) for hole in holes]
+
+    # Vec3 supports the _Point protocol in _mapbox_earcut.py
+    # required attributes: x, y
+    for triangle in earcut(exterior_ocs, holes_ocs):
+        yield tuple(
+            ocs.points_to_wcs(Vec3(v.x, v.y, elevation) for v in triangle)
+        )