geocond 0.1.1__tar.gz

geocond-0.1.1/LICENSE

@@ -0,0 +1,202 @@
+
+                                 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.

geocond-0.1.1/PKG-INFO

@@ -0,0 +1,43 @@
+Metadata-Version: 2.4
+Name: geocond
+Version: 0.1.1
+Summary: Support-aware spatial conditioning, covariance estimation and sequential simulation
+License-Expression: Apache-2.0
+Project-URL: Repository, https://github.com/fsantibanezleal/GeoCond
+Project-URL: Documentation, https://github.com/fsantibanezleal/GeoCond/tree/main/docs
+Project-URL: Issues, https://github.com/fsantibanezleal/GeoCond/issues
+Classifier: Development Status :: 3 - Alpha
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.12
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy<3,>=2.5
+Requires-Dist: scipy<2,>=1.18
+Provides-Extra: cuda
+Requires-Dist: torch<3,>=2.14; extra == "cuda"
+Provides-Extra: test
+Requires-Dist: pytest>=9; extra == "test"
+Requires-Dist: pytest-cov>=7; extra == "test"
+Provides-Extra: reference
+Requires-Dist: pykrige==1.7.3; extra == "reference"
+Requires-Dist: gstools==1.7.0; extra == "reference"
+Requires-Dist: welleng==0.29.1; extra == "reference"
+Requires-Dist: scikit-learn<2,>=1.8; extra == "reference"
+Provides-Extra: dev
+Requires-Dist: build>=1.4; extra == "dev"
+Requires-Dist: ruff>=0.14; extra == "dev"
+Requires-Dist: twine>=6; extra == "dev"
+Dynamic: license-file
+
+# GeoCond
+
+GeoCond is a Python library for support-aware spatial conditioning. Its scientific core separates observation geometry and sampling support from source-specific ingestion, web services and visualization.
+
+The first release is under active implementation. The API and acceptance contract are recorded in [docs/api-contract.md](docs/api-contract.md); this repository does not yet claim a published or validated package release.
+
+The complete planned core covers minimum-curvature trajectories, explicit support quadrature, conservative interval compositing, directional variograms, nearest/IDW baselines, simple/ordinary/universal kriging, full positive-semidefinite LMC cokriging, multiple-indicator CDFs, sequential Gaussian simulation and genuine training-image Direct Sampling. CPU calculations use NumPy/SciPy. CUDA kernels use an optional, lazily imported PyTorch dependency and retain the CPU algorithm's conditioning order.
+
+Source adapters, geological assumptions, grouped training splits, neural training, native SNESIM orchestration and application deployment belong to consuming products. No field datasets, credentials, personal information or infrastructure bindings are part of the library.
+
+Licensed under Apache-2.0. Numerical methods do not by themselves establish resource classes, reserves or operational certification.

geocond-0.1.1/README.md

@@ -0,0 +1,11 @@
+# GeoCond
+
+GeoCond is a Python library for support-aware spatial conditioning. Its scientific core separates observation geometry and sampling support from source-specific ingestion, web services and visualization.
+
+The first release is under active implementation. The API and acceptance contract are recorded in [docs/api-contract.md](docs/api-contract.md); this repository does not yet claim a published or validated package release.
+
+The complete planned core covers minimum-curvature trajectories, explicit support quadrature, conservative interval compositing, directional variograms, nearest/IDW baselines, simple/ordinary/universal kriging, full positive-semidefinite LMC cokriging, multiple-indicator CDFs, sequential Gaussian simulation and genuine training-image Direct Sampling. CPU calculations use NumPy/SciPy. CUDA kernels use an optional, lazily imported PyTorch dependency and retain the CPU algorithm's conditioning order.
+
+Source adapters, geological assumptions, grouped training splits, neural training, native SNESIM orchestration and application deployment belong to consuming products. No field datasets, credentials, personal information or infrastructure bindings are part of the library.
+
+Licensed under Apache-2.0. Numerical methods do not by themselves establish resource classes, reserves or operational certification.

geocond-0.1.1/pyproject.toml

@@ -0,0 +1,41 @@
+[build-system]
+requires = ["setuptools>=82"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "geocond"
+version = "0.1.1"
+description = "Support-aware spatial conditioning, covariance estimation and sequential simulation"
+readme = "README.md"
+requires-python = ">=3.12"
+license = "Apache-2.0"
+license-files = ["LICENSE"]
+dependencies = ["numpy>=2.5,<3", "scipy>=1.18,<2"]
+classifiers = ["Development Status :: 3 - Alpha", "Programming Language :: Python :: 3", "Topic :: Scientific/Engineering :: Mathematics"]
+
+[project.optional-dependencies]
+cuda = ["torch>=2.14,<3"]
+test = ["pytest>=9", "pytest-cov>=7"]
+reference = ["pykrige==1.7.3", "gstools==1.7.0", "welleng==0.29.1", "scikit-learn>=1.8,<2"]
+dev = ["build>=1.4", "ruff>=0.14", "twine>=6"]
+
+[project.urls]
+Repository = "https://github.com/fsantibanezleal/GeoCond"
+Documentation = "https://github.com/fsantibanezleal/GeoCond/tree/main/docs"
+Issues = "https://github.com/fsantibanezleal/GeoCond/issues"
+
+[tool.setuptools.packages.find]
+where = ["src"]
+
+[tool.setuptools.package-data]
+geocond = ["py.typed"]
+
+[tool.pytest.ini_options]
+testpaths = ["tests"]
+addopts = "-ra"
+markers = ["cuda: requires a real CUDA device", "reference: independent optional reference package"]
+
+[tool.ruff]
+line-length = 100
+target-version = "py312"
+

geocond-0.1.1/setup.cfg

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

geocond-0.1.1/src/geocond/__init__.py

@@ -0,0 +1,3 @@
+"""Support-aware spatial conditioning; see the versioned API contract."""
+
+__version__ = "0.01.001"

geocond-0.1.1/src/geocond/compositing.py

@@ -0,0 +1,154 @@
+"""Conservative continuous-interval overlap, coverage and category proportions."""
+
+from dataclasses import dataclass
+
+import numpy as np
+
+from .validation import ValidationError, array, positive
+
+
+@dataclass(frozen=True)
+class Composite:
+    start: float
+    end: float
+    mean: float
+    numerator: float
+    valid_length: float
+    missing_length: float
+    coverage: float
+    domain: str | None
+    parents: tuple[tuple[str, float], ...]
+    status: str
+
+
+def fixed_boundaries(start: float, end: float, length: float, *, residual: str = "keep"):
+    positive(length, "composite length")
+    if not np.isfinite([start, end]).all() or start < 0 or end <= start:
+        raise ValidationError("Composite range must be a positive measured-depth interval")
+    if residual not in {"keep", "drop"}:
+        raise ValidationError("Residual policy must be keep or drop")
+    count = int(np.floor((end - start) / length + 1e-12))
+    boundaries = start + np.arange(count + 1) * length
+    if residual == "keep" and end - boundaries[-1] > 1e-12 * max(1, end):
+        boundaries = np.r_[boundaries, end]
+    elif np.isclose(boundaries[-1], end, atol=1e-12, rtol=1e-12):
+        boundaries[-1] = end
+    return boundaries
+
+
+def _intervals(from_depth, to_depth, boundaries, source_ids, support_kind):
+    if support_kind != "continuous-interval":
+        raise ValidationError("Length compositing requires known continuous interval support")
+    a, b = array(from_depth, "from_depth", ndim=1), array(to_depth, "to_depth", ndim=1)
+    edges = array(boundaries, "boundaries", ndim=1)
+    if len(a) != len(b) or np.any(a < 0) or np.any(b <= a):
+        raise ValidationError("Every interval must have nonnegative start and positive length")
+    if len(edges) < 2 or edges[0] < 0 or np.any(np.diff(edges) <= 0):
+        raise ValidationError("Composite boundaries must be strictly increasing")
+    order = np.argsort(a, kind="stable")
+    if np.any(a[order][1:] < b[order][:-1]):
+        raise ValidationError(
+            "Overlapping intervals require a resolved observation policy before compositing"
+        )
+    ids = tuple(str(i) for i in range(len(a))) if source_ids is None else tuple(source_ids)
+    if len(ids) != len(a) or any(not isinstance(i, str) for i in ids) or len(set(ids)) != len(ids):
+        raise ValidationError("source_ids must be unique strings matching the input rows")
+    return a, b, edges, ids
+
+
+def composite_intervals(
+    from_depth,
+    to_depth,
+    values,
+    boundaries,
+    *,
+    support_kind="continuous-interval",
+    domains=None,
+    source_ids=None,
+    min_coverage=0,
+):
+    a, b, edges, ids = _intervals(from_depth, to_depth, boundaries, source_ids, support_kind)
+    values = array(values, "values", ndim=1, finite=False)
+    if len(values) != len(a) or np.isinf(values).any():
+        raise ValidationError("Interval values must match rows and be finite or NaN for missing")
+    if not np.isfinite(min_coverage) or not 0 <= min_coverage <= 1:
+        raise ValidationError("min_coverage must be between zero and one")
+    if domains is None:
+        labels = [None] * len(a)
+    else:
+        labels = list(domains)
+        if len(labels) != len(a) or any(x is not None and not isinstance(x, str) for x in labels):
+            raise ValidationError("domains must contain one string or null per interval")
+        cuts = []
+        order = np.argsort(a, kind="stable")
+        for i, j in zip(order[:-1], order[1:], strict=True):
+            if labels[i] != labels[j]:
+                cuts.extend((b[i], a[j]))
+        edges = np.unique(np.r_[edges, [x for x in cuts if edges[0] < x < edges[-1]]])
+    result = []
+    for lo, hi in zip(edges[:-1], edges[1:], strict=True):
+        overlap = np.maximum(0, np.minimum(b, hi) - np.maximum(a, lo))
+        selected = np.flatnonzero(overlap > 0)
+        valid = selected[np.isfinite(values[selected])]
+        length = float(overlap[valid].sum())
+        numerator = float(overlap[valid] @ values[valid])
+        coverage = length / (hi - lo)
+        domain_set = {labels[i] for i in selected}
+        if len(domain_set) > 1:
+            raise ValidationError("Composite crosses unresolved domains")
+        status = (
+            "estimated"
+            if length > 0 and coverage + 1e-14 >= min_coverage
+            else "insufficient-coverage"
+        )
+        result.append(
+            Composite(
+                float(lo),
+                float(hi),
+                numerator / length if status == "estimated" else np.nan,
+                numerator,
+                length,
+                float(hi - lo - length),
+                float(coverage),
+                next(iter(domain_set), None),
+                tuple((ids[i], float(overlap[i])) for i in selected),
+                status,
+            )
+        )
+    return tuple(result)
+
+
+def composite_categories(
+    from_depth,
+    to_depth,
+    categories,
+    boundaries,
+    *,
+    support_kind="continuous-interval",
+    source_ids=None,
+):
+    a, b, edges, ids = _intervals(from_depth, to_depth, boundaries, source_ids, support_kind)
+    labels = list(categories)
+    if len(labels) != len(a) or any(
+        x is not None and not isinstance(x, (str, int)) for x in labels
+    ):
+        raise ValidationError("Categories must be explicit string/integer codes or null")
+    result = []
+    for lo, hi in zip(edges[:-1], edges[1:], strict=True):
+        overlap = np.maximum(0, np.minimum(b, hi) - np.maximum(a, lo))
+        lengths = {}
+        for i in np.flatnonzero(overlap > 0):
+            if labels[i] is not None:
+                lengths[labels[i]] = lengths.get(labels[i], 0.0) + float(overlap[i])
+        total = sum(lengths.values())
+        result.append(
+            {
+                "start": float(lo),
+                "end": float(hi),
+                "coverage": total / (hi - lo),
+                "proportions": {k: v / total for k, v in lengths.items()},
+                "missing_length": float(hi - lo - total),
+                "parents": tuple((ids[i], float(overlap[i])) for i in np.flatnonzero(overlap > 0)),
+            }
+        )
+    return tuple(result)

geocond-0.1.1/src/geocond/geometry.py

@@ -0,0 +1,130 @@
+"""Minimum-curvature trajectories in east/north/elevation-up coordinates."""
+
+from dataclasses import dataclass, field
+
+import numpy as np
+from numpy.typing import ArrayLike, NDArray
+
+from .validation import ValidationError, array
+
+
+@dataclass(frozen=True)
+class TrajectorySamples:
+    measured_depth: NDArray[np.float64]
+    points: NDArray[np.float64]
+    tangents: NDArray[np.float64]
+    extended: NDArray[np.bool_]
+
+
+def tangent(azimuth: ArrayLike, dip: ArrayLike, *, angle_unit: str = "degree"):
+    a, d = array(azimuth, "azimuth"), array(dip, "dip")
+    if a.shape != d.shape:
+        raise ValidationError("azimuth and dip shapes differ")
+    if angle_unit not in {"degree", "radian"}:
+        raise ValidationError("angle_unit must be degree or radian")
+    if angle_unit == "degree":
+        a, d = np.deg2rad(a), np.deg2rad(d)
+    if np.any(np.abs(d) > np.pi / 2 + 1e-14):
+        raise ValidationError("dip must be between -90 and 90 degrees")
+    return np.stack((np.cos(d) * np.sin(a), np.cos(d) * np.cos(a), np.sin(d)), axis=-1)
+
+
+def _arc(t0, t1, length, fraction):
+    dot = float(np.clip(t0 @ t1, -1, 1))
+    beta = float(np.arctan2(np.linalg.norm(np.cross(t0, t1)), dot))
+    if np.pi - beta < 1e-7:
+        raise ValidationError("Antiparallel survey tangents do not determine an arc plane")
+    if beta < 1e-8:
+        direction = (1 - fraction) * t0 + fraction * t1
+        direction /= np.linalg.norm(direction)
+        displacement = length * fraction * ((1 - fraction / 2) * t0 + fraction / 2 * t1)
+        return displacement, direction, beta
+    normal = (t1 - dot * t0) / np.sin(beta)
+    angle = fraction * beta
+    displacement = length / beta * (np.sin(angle) * t0 + 2 * np.sin(angle / 2) ** 2 * normal)
+    return displacement, np.cos(angle) * t0 + np.sin(angle) * normal, beta
+
+
+@dataclass(frozen=True)
+class Survey:
+    collar: ArrayLike
+    measured_depth: ArrayLike
+    azimuth: ArrayLike
+    dip: ArrayLike
+    angle_unit: str = "degree"
+    start_extension: str = "error"
+    end_extension: str = "error"
+    station_points: NDArray[np.float64] = field(init=False, repr=False)
+    station_tangents: NDArray[np.float64] = field(init=False, repr=False)
+    dogleg_radians: NDArray[np.float64] = field(init=False, repr=False)
+
+    def __post_init__(self):
+        collar = array(self.collar, "collar", ndim=1)
+        md = array(self.measured_depth, "measured_depth", ndim=1)
+        az = array(self.azimuth, "azimuth", ndim=1)
+        dip = array(self.dip, "dip", ndim=1)
+        if collar.shape != (3,) or not len(md) or az.shape != md.shape or dip.shape != md.shape:
+            raise ValidationError("Survey needs a 3D collar and matching nonempty station arrays")
+        if md[0] < 0 or np.any(np.diff(md) <= 0):
+            raise ValidationError(
+                "Measured station depths must be nonnegative and strictly increasing"
+            )
+        for policy in (self.start_extension, self.end_extension):
+            if policy not in {"error", "tangent"}:
+                raise ValidationError("Extension policy must be error or tangent")
+        if md[0] > 0 and self.start_extension != "tangent":
+            raise ValidationError(
+                "First station is below the collar; explicit tangent extension required"
+            )
+        ts = tangent(az, dip, angle_unit=self.angle_unit)
+        xyz = np.empty((len(md), 3))
+        xyz[0] = collar + md[0] * ts[0]
+        doglegs = np.empty(max(0, len(md) - 1))
+        for i in range(len(md) - 1):
+            delta, _, doglegs[i] = _arc(ts[i], ts[i + 1], md[i + 1] - md[i], 1)
+            xyz[i + 1] = xyz[i] + delta
+        for name, value in [
+            ("collar", collar),
+            ("measured_depth", md),
+            ("azimuth", az),
+            ("dip", dip),
+            ("station_points", xyz),
+            ("station_tangents", ts),
+            ("dogleg_radians", doglegs),
+        ]:
+            value.setflags(write=False)
+            object.__setattr__(self, name, value)
+
+    def at(self, depths: ArrayLike) -> TrajectorySamples:
+        md = array(np.atleast_1d(depths), "depths", ndim=1)
+        if np.any(md < 0):
+            raise ValidationError("Evaluation depths must be nonnegative")
+        lo, hi = self.measured_depth[[0, -1]]
+        if np.any(md < lo) and self.start_extension != "tangent":
+            raise ValidationError("Evaluation precedes first survey station")
+        if np.any(md > hi) and self.end_extension != "tangent":
+            raise ValidationError(
+                "Evaluation exceeds last station; explicit tangent extension required"
+            )
+        xyz, direction = np.empty((len(md), 3)), np.empty((len(md), 3))
+        extended = (md < lo) | (md > hi)
+        for row, depth in enumerate(md):
+            if depth <= lo:
+                xyz[row] = self.collar + depth * self.station_tangents[0]
+                direction[row] = self.station_tangents[0]
+            elif depth >= hi:
+                xyz[row] = self.station_points[-1] + (depth - hi) * self.station_tangents[-1]
+                direction[row] = self.station_tangents[-1]
+            else:
+                i = np.searchsorted(self.measured_depth, depth, side="right") - 1
+                length = self.measured_depth[i + 1] - self.measured_depth[i]
+                delta, direction[row], _ = _arc(
+                    self.station_tangents[i],
+                    self.station_tangents[i + 1],
+                    length,
+                    (depth - self.measured_depth[i]) / length,
+                )
+                xyz[row] = self.station_points[i] + delta
+        for item in (xyz, direction, extended):
+            item.setflags(write=False)
+        return TrajectorySamples(md, xyz, direction, extended)

geocond-0.1.1/src/geocond/support.py

@@ -0,0 +1,107 @@
+"""Explicit known sampling measures and Gauss-Legendre support quadrature."""
+
+from dataclasses import dataclass
+from itertools import product
+
+import numpy as np
+from numpy.polynomial.legendre import leggauss
+from numpy.typing import ArrayLike
+
+from .geometry import Survey
+from .validation import ValidationError, array, integer, rotation_matrix
+
+
+@dataclass(frozen=True)
+class Support:
+    points: ArrayLike
+    weights: ArrayLike
+    kind: str
+    id: str = ""
+    measure: str | None = None
+
+    def __post_init__(self):
+        points, weights = (
+            array(self.points, "support points", ndim=2),
+            array(self.weights, "support weights", ndim=1),
+        )
+        if points.shape != (len(weights), 3) or not len(weights):
+            raise ValidationError("Support requires nonempty (n,3) points and n weights")
+        if self.kind not in {"point", "line", "trajectory", "block", "weighted"}:
+            raise ValidationError(
+                "Support must declare a known point, line, trajectory, block or weighted measure"
+            )
+        if np.any(weights < 0) or not np.isclose(weights.sum(), 1, atol=1e-12, rtol=0):
+            raise ValidationError("Known support weights must be nonnegative and sum to one")
+        if self.kind == "point" and len(weights) != 1:
+            raise ValidationError("Point support contains exactly one coordinate")
+        measure = self.measure
+        if measure is None:
+            if self.kind == "weighted":
+                raise ValidationError(
+                    "Weighted support must explicitly declare discrete or continuous measure"
+                )
+            measure = "discrete" if self.kind == "point" else "continuous"
+        if measure not in {"continuous", "discrete"}:
+            raise ValidationError("Support measure must be continuous or discrete")
+        if self.kind == "point" and measure != "discrete":
+            raise ValidationError("A point support is a discrete sampling measure")
+        object.__setattr__(self, "points", points)
+        object.__setattr__(self, "weights", weights)
+        object.__setattr__(self, "measure", measure)
+
+    @property
+    def center(self):
+        return self.weights @ self.points
+
+
+def point_support(point: ArrayLike, *, id: str = "") -> Support:
+    point = array(point, "point", ndim=1)
+    return Support(point[None, :], [1.0], "point", id)
+
+
+def line_support(start: ArrayLike, end: ArrayLike, *, order: int = 8, id: str = "") -> Support:
+    a, b = array(start, "start", ndim=1), array(end, "end", ndim=1)
+    if a.shape != (3,) or b.shape != (3,) or np.linalg.norm(b - a) == 0:
+        raise ValidationError("Line support needs distinct 3D endpoints")
+    nodes, weights = leggauss(integer(order, "quadrature order"))
+    return Support(a + (nodes[:, None] + 1) / 2 * (b - a), weights / 2, "line", id)
+
+
+def trajectory_support(
+    survey: Survey, start: float, end: float, *, order: int = 8, id: str = ""
+) -> Support:
+    if not np.isfinite([start, end]).all() or start < 0 or end <= start:
+        raise ValidationError("Trajectory support requires a positive measured-depth interval")
+    nodes, weights = leggauss(integer(order, "quadrature order"))
+    boundaries = np.r_[
+        start,
+        survey.measured_depth[(survey.measured_depth > start) & (survey.measured_depth < end)],
+        end,
+    ]
+    points, measure = [], []
+    for a, b in zip(boundaries[:-1], boundaries[1:], strict=True):
+        points.append(survey.at(a + (nodes + 1) / 2 * (b - a)).points)
+        measure.append(weights / 2 * (b - a) / (end - start))
+    return Support(np.concatenate(points), np.concatenate(measure), "trajectory", id)
+
+
+def block_support(
+    center: ArrayLike,
+    size: ArrayLike,
+    *,
+    order: int | tuple = 4,
+    rotation: ArrayLike | None = None,
+    id: str = "",
+) -> Support:
+    center, size = array(center, "block center", ndim=1), array(size, "block size", ndim=1)
+    if center.shape != (3,) or size.shape != (3,) or np.any(size <= 0):
+        raise ValidationError("Block center and positive size must each have three components")
+    orders = (order,) * 3 if np.isscalar(order) else tuple(order)
+    if len(orders) != 3:
+        raise ValidationError("Block quadrature needs three orders")
+    rules = [leggauss(integer(o, "quadrature order")) for o in orders]
+    points, weights = [], []
+    for indices in product(*(range(o) for o in orders)):
+        points.append([rules[d][0][i] * size[d] / 2 for d, i in enumerate(indices)])
+        weights.append(np.prod([rules[d][1][i] / 2 for d, i in enumerate(indices)]))
+    return Support(center + np.asarray(points) @ rotation_matrix(rotation).T, weights, "block", id)

geocond-0.1.1/src/geocond/validation.py

@@ -0,0 +1,61 @@
+"""Strict numerical validation and explicit failure types."""
+
+from collections.abc import Callable
+
+import numpy as np
+from numpy.typing import ArrayLike, NDArray
+
+
+class ValidationError(ValueError):
+    """Shared input violates a scientific or numerical contract."""
+
+
+class NumericalError(RuntimeError):
+    """A scientifically specified system cannot be solved within its policy."""
+
+
+class CancelledError(RuntimeError):
+    """Computation was cancelled; no complete result is available."""
+
+
+def array(
+    value: ArrayLike, name: str, *, ndim: int | None = None, finite: bool = True
+) -> NDArray[np.float64]:
+    raw = np.asarray(value)
+    if raw.dtype.kind not in "iuf":
+        raise ValidationError(f"{name} must contain numeric values, not strings or booleans")
+    result = np.array(raw, dtype=np.float64, copy=True)
+    if ndim is not None and result.ndim != ndim:
+        raise ValidationError(f"{name} must have {ndim} dimensions")
+    if finite and not np.isfinite(result).all():
+        raise ValidationError(f"{name} must contain only finite values")
+    result.setflags(write=False)
+    return result
+
+
+def positive(value: float, name: str, *, zero: bool = False) -> float:
+    if isinstance(value, (bool, np.bool_)) or not np.isfinite(value):
+        raise ValidationError(f"{name} must be a finite number")
+    if value < 0 if zero else value <= 0:
+        raise ValidationError(f"{name} must be {'nonnegative' if zero else 'positive'}")
+    return float(value)
+
+
+def integer(value: int, name: str, *, minimum: int = 1) -> int:
+    if isinstance(value, (bool, np.bool_)) or int(value) != value or value < minimum:
+        raise ValidationError(f"{name} must be an integer >= {minimum}")
+    return int(value)
+
+
+def cancel_if_requested(cancel: Callable[[], bool] | None) -> None:
+    if cancel is not None and cancel():
+        raise CancelledError("Computation cancelled before a complete result was produced")
+
+
+def rotation_matrix(value: ArrayLike | None) -> NDArray[np.float64]:
+    result = array(np.eye(3) if value is None else value, "rotation", ndim=2)
+    if result.shape != (3, 3) or not np.allclose(result.T @ result, np.eye(3), atol=1e-10):
+        raise ValidationError("rotation must be an orthonormal 3 by 3 matrix")
+    if not np.isclose(np.linalg.det(result), 1, atol=1e-10):
+        raise ValidationError("rotation must be proper and right handed")
+    return result

geocond-0.1.1/src/geocond.egg-info/PKG-INFO

@@ -0,0 +1,43 @@
+Metadata-Version: 2.4
+Name: geocond
+Version: 0.1.1
+Summary: Support-aware spatial conditioning, covariance estimation and sequential simulation
+License-Expression: Apache-2.0
+Project-URL: Repository, https://github.com/fsantibanezleal/GeoCond
+Project-URL: Documentation, https://github.com/fsantibanezleal/GeoCond/tree/main/docs
+Project-URL: Issues, https://github.com/fsantibanezleal/GeoCond/issues
+Classifier: Development Status :: 3 - Alpha
+Classifier: Programming Language :: Python :: 3
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.12
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy<3,>=2.5
+Requires-Dist: scipy<2,>=1.18
+Provides-Extra: cuda
+Requires-Dist: torch<3,>=2.14; extra == "cuda"
+Provides-Extra: test
+Requires-Dist: pytest>=9; extra == "test"
+Requires-Dist: pytest-cov>=7; extra == "test"
+Provides-Extra: reference
+Requires-Dist: pykrige==1.7.3; extra == "reference"
+Requires-Dist: gstools==1.7.0; extra == "reference"
+Requires-Dist: welleng==0.29.1; extra == "reference"
+Requires-Dist: scikit-learn<2,>=1.8; extra == "reference"
+Provides-Extra: dev
+Requires-Dist: build>=1.4; extra == "dev"
+Requires-Dist: ruff>=0.14; extra == "dev"
+Requires-Dist: twine>=6; extra == "dev"
+Dynamic: license-file
+
+# GeoCond
+
+GeoCond is a Python library for support-aware spatial conditioning. Its scientific core separates observation geometry and sampling support from source-specific ingestion, web services and visualization.
+
+The first release is under active implementation. The API and acceptance contract are recorded in [docs/api-contract.md](docs/api-contract.md); this repository does not yet claim a published or validated package release.
+
+The complete planned core covers minimum-curvature trajectories, explicit support quadrature, conservative interval compositing, directional variograms, nearest/IDW baselines, simple/ordinary/universal kriging, full positive-semidefinite LMC cokriging, multiple-indicator CDFs, sequential Gaussian simulation and genuine training-image Direct Sampling. CPU calculations use NumPy/SciPy. CUDA kernels use an optional, lazily imported PyTorch dependency and retain the CPU algorithm's conditioning order.
+
+Source adapters, geological assumptions, grouped training splits, neural training, native SNESIM orchestration and application deployment belong to consuming products. No field datasets, credentials, personal information or infrastructure bindings are part of the library.
+
+Licensed under Apache-2.0. Numerical methods do not by themselves establish resource classes, reserves or operational certification.

geocond-0.1.1/src/geocond.egg-info/SOURCES.txt

@@ -0,0 +1,15 @@
+LICENSE
+README.md
+pyproject.toml
+src/geocond/__init__.py
+src/geocond/compositing.py
+src/geocond/geometry.py
+src/geocond/py.typed
+src/geocond/support.py
+src/geocond/validation.py
+src/geocond.egg-info/PKG-INFO
+src/geocond.egg-info/SOURCES.txt
+src/geocond.egg-info/dependency_links.txt
+src/geocond.egg-info/requires.txt
+src/geocond.egg-info/top_level.txt
+tests/test_geometry_support.py

geocond-0.1.1/src/geocond.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

geocond-0.1.1/src/geocond.egg-info/requires.txt

@@ -0,0 +1,20 @@
+numpy<3,>=2.5
+scipy<2,>=1.18
+
+[cuda]
+torch<3,>=2.14
+
+[dev]
+build>=1.4
+ruff>=0.14
+twine>=6
+
+[reference]
+pykrige==1.7.3
+gstools==1.7.0
+welleng==0.29.1
+scikit-learn<2,>=1.8
+
+[test]
+pytest>=9
+pytest-cov>=7

geocond-0.1.1/src/geocond.egg-info/top_level.txt

@@ -0,0 +1 @@
+geocond

geocond-0.1.1/tests/test_geometry_support.py

@@ -0,0 +1,120 @@
+import numpy as np
+import pytest
+from numpy.testing import assert_allclose
+
+from geocond.geometry import Survey, tangent
+from geocond.support import Support, block_support, line_support, point_support, trajectory_support
+from geocond.compositing import composite_categories, composite_intervals, fixed_boundaries
+from geocond.validation import ValidationError
+
+
+def test_straight_directions_and_arbitrary_tangent():
+    for az, dip in [(0, -90), (90, 0), (359, -37)]:
+        survey = Survey([12, 34, 500], [0, 100], [az, az], [dip, dip])
+        depths = np.array([0, 17, 100])
+        assert_allclose(
+            survey.at(depths).points, survey.collar + depths[:, None] * tangent(az, dip), atol=1e-12
+        )
+
+
+def test_quarter_arc_and_inserted_station_are_same_curve():
+    length = 100.0
+    original = Survey([0, 0, 0], [0, length], [0, 0], [0, -90])
+    refined = Survey([0, 0, 0], [0, 50, length], [0, 0, 0], [0, -45, -90])
+    depths = np.linspace(0, length, 101)
+    theta = depths / length * np.pi / 2
+    exact = np.column_stack(
+        [
+            np.zeros_like(theta),
+            2 * length / np.pi * np.sin(theta),
+            -2 * length / np.pi * (1 - np.cos(theta)),
+        ]
+    )
+    assert_allclose(original.at(depths).points, exact, atol=1e-12)
+    assert_allclose(refined.at(depths).points, exact, atol=1e-12)
+    assert not np.allclose(original.at([50]).points[0], original.station_points[-1] / 2)
+
+
+def test_azimuth_wrap_near_zero_and_antiparallel():
+    survey = Survey([0, 0, 0], [0, 100], [359, 1], [0, 0])
+    assert abs(survey.station_points[-1, 0]) < 1e-12
+    assert survey.station_points[-1, 1] > 99.9
+    tiny = Survey([0, 0, 0], [0, 100], [1, 1 + 1e-9], [-20, -20])
+    assert np.isfinite(tiny.at([50]).points).all()
+    with pytest.raises(ValidationError, match="Antiparallel"):
+        Survey([0, 0, 0], [0, 100], [0, 180], [0, 0])
+
+
+def test_extensions_are_explicit_and_inputs_are_owned():
+    with pytest.raises(ValidationError, match="First station"):
+        Survey([0, 0, 0], [10, 50], [0, 0], [-90, -90])
+    md = np.array([10.0, 50.0])
+    survey = Survey([0, 0, 0], md, [0, 0], [-90, -90], start_extension="tangent")
+    md[1] = 1000
+    assert survey.measured_depth[-1] == 50
+    assert survey.at([0, 10, 25]).extended.tolist() == [True, False, False]
+    with pytest.raises(ValidationError, match="exceeds"):
+        survey.at([51])
+    with pytest.raises(ValueError):
+        survey.collar[0] = 3
+
+
+@pytest.mark.parametrize(
+    "md,az,dip",
+    [([0, 0], [0, 0], [0, 0]), ([0, 1], [0, 0], [0, -91]), ([0, 1], [0, np.inf], [0, 0])],
+)
+def test_bad_survey_rejected(md, az, dip):
+    with pytest.raises(ValidationError):
+        Survey([0, 0, 0], md, az, dip)
+
+
+def test_support_quadrature_integrates_polynomials_and_arc():
+    line = line_support([0, 0, 0], [2, 0, 0], order=3)
+    assert_allclose(line.weights @ line.points[:, 0] ** 4, 16 / 5)
+    block = block_support([1, 2, 3], [2, 4, 6], order=(3, 4, 5))
+    assert_allclose(block.center, [1, 2, 3])
+    assert_allclose(block.weights @ (block.points[:, 1] - 2) ** 2, 4 / 3)
+    survey = Survey([0, 0, 0], [0, 50, 100], [0, 0, 0], [0, -45, -90])
+    support = trajectory_support(survey, 0, 100, order=8)
+    assert_allclose(support.center, [0, 400 / np.pi**2, 400 / np.pi**2 - 200 / np.pi], atol=1e-12)
+    assert support.measure == "continuous"
+    assert point_support([0, 0, 0]).measure == "discrete"
+
+
+def test_unknown_support_and_bad_weights_not_accepted():
+    for kwargs in [{"kind": "sampling-envelope"}, {"kind": "weighted"}]:
+        with pytest.raises(ValidationError):
+            Support([[0, 0, 0]], [1], **kwargs)
+    with pytest.raises(ValidationError):
+        Support([[0, 0, 0], [1, 1, 1]], [0.5, -0.5], "weighted", measure="discrete")
+    with pytest.raises(ValidationError):
+        block_support([0, 0, 0], [1, 1, 1], rotation=np.diag([-1, 1, 1]))
+
+
+def test_composite_conservation_coverage_missing_and_domains():
+    result = composite_intervals([0, 1], [1, 3], [2, 5], [0, 2, 3], source_ids=["s0", "s1"])
+    assert_allclose([c.mean for c in result], [3.5, 5])
+    assert sum(c.numerator for c in result) == 12
+    assert sum(c.valid_length for c in result) == 3
+    assert result[0].parents == (("s0", 1), ("s1", 1))
+    missing = composite_intervals([0, 2, 3], [1, 3, 4], [0, np.nan, 8], [0, 4])[0]
+    assert (missing.mean, missing.coverage, missing.missing_length) == (4, 0.5, 2)
+    split = composite_intervals([0, 1], [1, 3], [2, 5], [0, 3], domains=["ore", "waste"])
+    assert [c.domain for c in split] == ["ore", "waste"]
+    assert_allclose([c.mean for c in split], [2, 5])
+
+
+def test_composite_rejects_overlap_and_envelopes_residual_explicit():
+    with pytest.raises(ValidationError, match="Overlapping"):
+        composite_intervals([0, 0.5], [1, 2], [2, 3], [0, 2])
+    with pytest.raises(ValidationError, match="known continuous"):
+        composite_intervals([0], [1], [3], [0, 1], support_kind="sampling-envelope")
+    assert_allclose(fixed_boundaries(0, 5, 2), [0, 2, 4, 5])
+    assert_allclose(fixed_boundaries(0, 5, 2, residual="drop"), [0, 2, 4])
+    assert np.isnan(composite_intervals([0], [1], [2], [0, 2], min_coverage=0.8)[0].mean)
+
+
+def test_category_proportions_do_not_average_codes_or_fill_unknown():
+    result = composite_categories([0, 1, 2], [1, 2, 4], ["A", None, "B"], [0, 4])[0]
+    assert result["proportions"] == {"A": 1 / 3, "B": 2 / 3}
+    assert result["coverage"] == 0.75