fungeom 0.1.0__tar.gz

fungeom-0.1.0/.gitignore

@@ -0,0 +1,23 @@
+# Python bytecode / packaging
+__pycache__/
+*.py[cod]
+*.egg-info/
+build/
+dist/
+
+# Virtual environment
+.venv/
+
+# Tooling caches / reports
+.mypy_cache/
+.pytest_cache/
+.ruff_cache/
+.coverage
+coverage.xml
+htmlcov/
+
+# Editor / OS
+.DS_Store
+
+# Claude Code: personal (machine-local) settings — shared settings.json IS tracked
+.claude/settings.local.json

fungeom-0.1.0/CHANGELOG.md

@@ -0,0 +1,29 @@
+# Changelog
+
+All notable changes to fungeom are documented here. The format follows
+[Keep a Changelog](https://keepachangelog.com/en/1.1.0/), and the project adheres to
+[Semantic Versioning](https://semver.org/spec/v2.0.0.html). The version is derived from git tags
+(`vX.Y.Z`); see [RELEASING.md](RELEASING.md).
+
+## [Unreleased]
+
+The first release. fungeom models geometry as an immutable, lazily-evaluated, **decidable** graph
+of resolvers where partiality is first-class (`decide()` → `Resolvable` / `Unresolvable`).
+
+### Added
+
+- **Decidability core** — `Resolver`, `Resolvable` / `Unresolvable` (reason-carrying), `gather`,
+  memoized `decide()`; `resolve()` / `is_resolvable` derived from it.
+- **Geometry** — `Scalar`, `Vec2` / `Vec3`, `Direction2` / `Direction3`, `Transform` / `Transform2`,
+  `Frame` / `Frame2`, `Point2` / `Point3`, and the `Plane` / `Line` / `Ray` / `Segment` family.
+- **Logic** — three-valued `Bool` with strict propagation.
+- **Time** — `Duration`, `Instant`, `Interval`, `Coverage`, `Sampling`, `Timeline`, `TimeMap`,
+  `TimeWarp`.
+- **Signals** — `Scalar` / `Vec3` / `Direction3` / `Transform` / `Point3` signals, `PlaneSignal`,
+  and the three-valued `BoolSignal`; derivatives, reductions, transport, `lift`/`map`,
+  `resolve_over`.
+- **Collections** — `…Bundle` and `…BundleSignal` (occlusion-aware), `Roster` / `RosterMap`.
+- **Regions** — `Point2Bundle`, `Region2` (general GEOS-backed boolean algebra + `offset`), `Face`.
+- Ten runnable examples, full wiki + reference docs, 100% test coverage.
+
+[Unreleased]: https://github.com/ryanrudes/fungeom/commits/main

fungeom-0.1.0/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 2026 Ryan Rudes
+
+   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.

fungeom-0.1.0/PKG-INFO

@@ -0,0 +1,168 @@
+Metadata-Version: 2.4
+Name: fungeom
+Version: 0.1.0
+Summary: Functional geometry as an immutable, decidable resolver graph.
+Project-URL: Repository, https://github.com/ryanrudes/fungeom
+Project-URL: Documentation, https://github.com/ryanrudes/fungeom/wiki
+Project-URL: Issues, https://github.com/ryanrudes/fungeom/issues
+Project-URL: Changelog, https://github.com/ryanrudes/fungeom/blob/main/CHANGELOG.md
+Author: Ryan Rudes
+License: Apache-2.0
+License-File: LICENSE
+Keywords: decidability,frames,functional,geometry,transforms
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Classifier: Typing :: Typed
+Requires-Python: >=3.13
+Requires-Dist: numpy>=2.4.6
+Requires-Dist: rich>=15.0.0
+Requires-Dist: scipy>=1.17.1
+Requires-Dist: shapely>=2.0.0
+Provides-Extra: dev
+Requires-Dist: mypy>=1.11; extra == 'dev'
+Requires-Dist: pytest-cov>=5.0; extra == 'dev'
+Requires-Dist: pytest>=8.2; extra == 'dev'
+Requires-Dist: ruff>=0.6; extra == 'dev'
+Description-Content-Type: text/markdown
+
+<h1 align="center">fungeom</h1>
+
+<p align="center"><em>Functional geometry as an immutable, decidable resolver graph.</em></p>
+
+<p align="center">
+  <a href="https://github.com/ryanrudes/fungeom/actions/workflows/ci.yml"><img alt="CI" src="https://github.com/ryanrudes/fungeom/actions/workflows/ci.yml/badge.svg"></a>
+  <img alt="Python 3.13+" src="https://img.shields.io/badge/python-3.13%2B-blue">
+  <img alt="Coverage 100%" src="https://img.shields.io/badge/coverage-100%25-brightgreen">
+  <img alt="License Apache-2.0" src="https://img.shields.io/badge/license-Apache--2.0-lightgrey">
+</p>
+
+---
+
+fungeom is a Python library for building geometry as a **lazy, immutable graph** you can *reason
+about before you compute it*. You compose points, vectors, frames, transforms, time-signals, and
+regions; ask whether the result **can** be resolved; and — when it can't — get back a *reason*,
+not an exception or a silent `NaN`.
+
+Its one big idea: **partiality is first-class**. A geometric question with no answer (a point in a
+frame that was never placed, a direction from a zero-length vector, a marker occluded mid-capture)
+is an honest `Unresolvable` *with an explanation that propagates through everything built on top of
+it* — never a crash, never an invented number.
+
+```python
+from fungeom import Point3, Frame, Resolvable, Unresolvable
+
+gripper = Frame.detached("gripper")          # a sub-assembly, not yet placed in the world
+tip = Point3.at(0, 0, 0.1, frame=gripper)    # a point in the gripper's frame — built lazily
+
+match tip.decide():                          # ask whether it can be resolved...
+    case Resolvable(point):  print(point.coord)
+    case Unresolvable(why):  print(why)      # "frame 'gripper' is not grounded to the world"
+```
+
+Nothing above is computed until you ask. `decide()` returns *evidence* — the value if it resolves,
+or the reason if it doesn't — and `resolve()` is just `decide().unwrap()`, so the two can never
+disagree.
+
+## Why fungeom
+
+- **Decidable, not crash-prone.** Every resolver answers `decide()` → `Resolvable(value)` or
+  `Unresolvable(reason)`. Partiality propagates: a midpoint is resolvable only if both ends are, and
+  the *reason* flows across type boundaries unchanged.
+- **Lazy & immutable.** Geometry is a graph of frozen values; every op returns a new node and
+  computes nothing until `decide()`/`resolve()`. You can even [render the graph](docs/reference.md#seeing-the-graph)
+  to *see* where an unresolvability lives.
+- **Everything is a resolver — even scalars.** A scale factor, an interpolation parameter, a
+  vector's norm are all first-class nodes, so values flow across types and dividing by a
+  resolves-to-zero scalar is `Unresolvable`, not a runtime error.
+- **One class per primitive.** You both *construct from* it (classmethods like `Vec3.of`,
+  `Point3.at`) and *compose with* it (fluent methods like `a.midpoint(b)`). No builders, no visitors.
+
+## Install
+
+```bash
+uv pip install -e '.[dev]'      # from a checkout (dev extras: ruff, mypy, pytest)
+```
+
+Requires Python 3.13+. Runtime deps: `numpy`, `scipy`, `rich`, `shapely`.
+
+## The surface, at a glance
+
+| Layer | Primitives | What it's for |
+| --- | --- | --- |
+| **Geometry** | `Scalar`, `Vec2/3`, `Direction3`, `Transform`, `Frame`, `Point3`, `Plane`, `Line`, `Ray`, `Segment` (+ 2D siblings) | points, frames, rigid motion — the classic kit, made decidable |
+| **Logic** | `Bool` | three-valued predicates with strict propagation |
+| **Time** | `Duration`, `Instant`, `Interval`, `Coverage`, `Timeline`, `Sampling`, `TimeMap`, `TimeWarp` | durations, clocks, gappy supports, alignment |
+| **Signals** | `ScalarSignal`, `Vec3Signal`, …, `PlaneSignal`, `BoolSignal` | values that vary over time — partial functions of a clock |
+| **Collections** | `…Bundle`, `…BundleSignal`, `Roster`, `RosterMap` | keyed sets (marker clouds) and sets-over-time, occlusion-aware |
+| **Regions** | `Region2`, `Face`, `Point2Bundle` | bounded planar areas, the balance margin, bounded contact patches |
+
+The **complete combinator table** (every constructor, every op, and its exact partiality) lives in
+[`docs/reference.md`](docs/reference.md).
+
+## A taste — contact detection, end to end
+
+Everything composes and stays lazy. Here is the spine of a real motion-capture task — *when is a
+foot in contact with the ground?* — built without ever inventing a number:
+
+```python
+clearances = ground_cloud.fit_plane().signed_distance(foot_cloud)  # per-marker height, over time
+contact = clearances.min().le(0.0)                                 # a three-valued BoolSignal
+print(contact.when_true().resolve())   # the contact interval(s)
+print(contact.first_true().resolve())  # touchdown
+print(contact.last_true().resolve())   # release
+```
+
+If a marker drops out, the predicate is `Unresolvable` there — *undefined*, never silently `False`.
+See [`examples/10_contact_over_time.py`](examples/10_contact_over_time.py) for the runnable version.
+
+## Examples
+
+Runnable, commented scripts in [`examples/`](examples/) (each is exercised by the test suite, so
+they stay current). Start at the top and work down:
+
+| Script | Shows |
+| --- | --- |
+| [`01_quickstart`](examples/01_quickstart.py) | construct → compose → resolve; scalars flowing across types |
+| [`02_coordinate_frames`](examples/02_coordinate_frames.py) | a kinematic chain; grounding, and why an unplaced frame is `Unresolvable` |
+| [`03_decidability_and_partiality`](examples/03_decidability_and_partiality.py) | value-dependent partialities, reasons, propagation; predicates as decidable `Bool`s |
+| [`04_visualizing_resolvers`](examples/04_visualizing_resolvers.py) | rendering the lazy graph to *see* where an unresolvability lives |
+| [`05_time_and_clocks`](examples/05_time_and_clocks.py) | the temporal layer: durations/instants, intervals & coverage with gaps |
+| [`06_signals_over_time`](examples/06_signals_over_time.py) | signals as partial functions of time; `at`/`resample`/`reparameterize`; slerp on a manifold |
+| [`07_aligning_and_warping`](examples/07_aligning_and_warping.py) | recovering the time map between two recordings from landmarks |
+| [`08_point_clouds_over_time`](examples/08_point_clouds_over_time.py) | a `Point3Bundle` and a cloud over time — an occluded marker is honestly `Unresolvable` |
+| [`09_regions_and_patches`](examples/09_regions_and_patches.py) | the 2D region algebra, the balance margin, and a bounded-patch `Face` |
+| [`10_contact_over_time`](examples/10_contact_over_time.py) | the contact spine end-to-end; touchdown & release from marker data |
+
+```bash
+python examples/01_quickstart.py
+```
+
+## Learn more
+
+- **[Wiki](https://github.com/ryanrudes/fungeom/wiki)** — narrative guides: the core concepts, each
+  layer, and how to add a primitive.
+- **[`docs/reference.md`](docs/reference.md)** — the complete combinator table, architecture, and
+  design notes.
+- **Deep dives** — [`docs/time.md`](docs/time.md), [`docs/collections.md`](docs/collections.md),
+  [`docs/regions.md`](docs/regions.md).
+
+## Development
+
+```bash
+uv pip install -e '.[dev]'
+pytest --cov=fungeom   # tests + 100% coverage gate
+ruff check . && ruff format --check .
+mypy                   # strict
+```
+
+CI runs all four on every push; the same checks are available as pre-commit hooks
+(`pre-commit install && pre-commit install --hook-type pre-push`). Every primitive and combinator,
+with the checks it has passed, is tracked in [`CHECKLIST.md`](CHECKLIST.md).
+
+## License
+
+[Apache-2.0](LICENSE).

fungeom-0.1.0/README.md

@@ -0,0 +1,137 @@
+<h1 align="center">fungeom</h1>
+
+<p align="center"><em>Functional geometry as an immutable, decidable resolver graph.</em></p>
+
+<p align="center">
+  <a href="https://github.com/ryanrudes/fungeom/actions/workflows/ci.yml"><img alt="CI" src="https://github.com/ryanrudes/fungeom/actions/workflows/ci.yml/badge.svg"></a>
+  <img alt="Python 3.13+" src="https://img.shields.io/badge/python-3.13%2B-blue">
+  <img alt="Coverage 100%" src="https://img.shields.io/badge/coverage-100%25-brightgreen">
+  <img alt="License Apache-2.0" src="https://img.shields.io/badge/license-Apache--2.0-lightgrey">
+</p>
+
+---
+
+fungeom is a Python library for building geometry as a **lazy, immutable graph** you can *reason
+about before you compute it*. You compose points, vectors, frames, transforms, time-signals, and
+regions; ask whether the result **can** be resolved; and — when it can't — get back a *reason*,
+not an exception or a silent `NaN`.
+
+Its one big idea: **partiality is first-class**. A geometric question with no answer (a point in a
+frame that was never placed, a direction from a zero-length vector, a marker occluded mid-capture)
+is an honest `Unresolvable` *with an explanation that propagates through everything built on top of
+it* — never a crash, never an invented number.
+
+```python
+from fungeom import Point3, Frame, Resolvable, Unresolvable
+
+gripper = Frame.detached("gripper")          # a sub-assembly, not yet placed in the world
+tip = Point3.at(0, 0, 0.1, frame=gripper)    # a point in the gripper's frame — built lazily
+
+match tip.decide():                          # ask whether it can be resolved...
+    case Resolvable(point):  print(point.coord)
+    case Unresolvable(why):  print(why)      # "frame 'gripper' is not grounded to the world"
+```
+
+Nothing above is computed until you ask. `decide()` returns *evidence* — the value if it resolves,
+or the reason if it doesn't — and `resolve()` is just `decide().unwrap()`, so the two can never
+disagree.
+
+## Why fungeom
+
+- **Decidable, not crash-prone.** Every resolver answers `decide()` → `Resolvable(value)` or
+  `Unresolvable(reason)`. Partiality propagates: a midpoint is resolvable only if both ends are, and
+  the *reason* flows across type boundaries unchanged.
+- **Lazy & immutable.** Geometry is a graph of frozen values; every op returns a new node and
+  computes nothing until `decide()`/`resolve()`. You can even [render the graph](docs/reference.md#seeing-the-graph)
+  to *see* where an unresolvability lives.
+- **Everything is a resolver — even scalars.** A scale factor, an interpolation parameter, a
+  vector's norm are all first-class nodes, so values flow across types and dividing by a
+  resolves-to-zero scalar is `Unresolvable`, not a runtime error.
+- **One class per primitive.** You both *construct from* it (classmethods like `Vec3.of`,
+  `Point3.at`) and *compose with* it (fluent methods like `a.midpoint(b)`). No builders, no visitors.
+
+## Install
+
+```bash
+uv pip install -e '.[dev]'      # from a checkout (dev extras: ruff, mypy, pytest)
+```
+
+Requires Python 3.13+. Runtime deps: `numpy`, `scipy`, `rich`, `shapely`.
+
+## The surface, at a glance
+
+| Layer | Primitives | What it's for |
+| --- | --- | --- |
+| **Geometry** | `Scalar`, `Vec2/3`, `Direction3`, `Transform`, `Frame`, `Point3`, `Plane`, `Line`, `Ray`, `Segment` (+ 2D siblings) | points, frames, rigid motion — the classic kit, made decidable |
+| **Logic** | `Bool` | three-valued predicates with strict propagation |
+| **Time** | `Duration`, `Instant`, `Interval`, `Coverage`, `Timeline`, `Sampling`, `TimeMap`, `TimeWarp` | durations, clocks, gappy supports, alignment |
+| **Signals** | `ScalarSignal`, `Vec3Signal`, …, `PlaneSignal`, `BoolSignal` | values that vary over time — partial functions of a clock |
+| **Collections** | `…Bundle`, `…BundleSignal`, `Roster`, `RosterMap` | keyed sets (marker clouds) and sets-over-time, occlusion-aware |
+| **Regions** | `Region2`, `Face`, `Point2Bundle` | bounded planar areas, the balance margin, bounded contact patches |
+
+The **complete combinator table** (every constructor, every op, and its exact partiality) lives in
+[`docs/reference.md`](docs/reference.md).
+
+## A taste — contact detection, end to end
+
+Everything composes and stays lazy. Here is the spine of a real motion-capture task — *when is a
+foot in contact with the ground?* — built without ever inventing a number:
+
+```python
+clearances = ground_cloud.fit_plane().signed_distance(foot_cloud)  # per-marker height, over time
+contact = clearances.min().le(0.0)                                 # a three-valued BoolSignal
+print(contact.when_true().resolve())   # the contact interval(s)
+print(contact.first_true().resolve())  # touchdown
+print(contact.last_true().resolve())   # release
+```
+
+If a marker drops out, the predicate is `Unresolvable` there — *undefined*, never silently `False`.
+See [`examples/10_contact_over_time.py`](examples/10_contact_over_time.py) for the runnable version.
+
+## Examples
+
+Runnable, commented scripts in [`examples/`](examples/) (each is exercised by the test suite, so
+they stay current). Start at the top and work down:
+
+| Script | Shows |
+| --- | --- |
+| [`01_quickstart`](examples/01_quickstart.py) | construct → compose → resolve; scalars flowing across types |
+| [`02_coordinate_frames`](examples/02_coordinate_frames.py) | a kinematic chain; grounding, and why an unplaced frame is `Unresolvable` |
+| [`03_decidability_and_partiality`](examples/03_decidability_and_partiality.py) | value-dependent partialities, reasons, propagation; predicates as decidable `Bool`s |
+| [`04_visualizing_resolvers`](examples/04_visualizing_resolvers.py) | rendering the lazy graph to *see* where an unresolvability lives |
+| [`05_time_and_clocks`](examples/05_time_and_clocks.py) | the temporal layer: durations/instants, intervals & coverage with gaps |
+| [`06_signals_over_time`](examples/06_signals_over_time.py) | signals as partial functions of time; `at`/`resample`/`reparameterize`; slerp on a manifold |
+| [`07_aligning_and_warping`](examples/07_aligning_and_warping.py) | recovering the time map between two recordings from landmarks |
+| [`08_point_clouds_over_time`](examples/08_point_clouds_over_time.py) | a `Point3Bundle` and a cloud over time — an occluded marker is honestly `Unresolvable` |
+| [`09_regions_and_patches`](examples/09_regions_and_patches.py) | the 2D region algebra, the balance margin, and a bounded-patch `Face` |
+| [`10_contact_over_time`](examples/10_contact_over_time.py) | the contact spine end-to-end; touchdown & release from marker data |
+
+```bash
+python examples/01_quickstart.py
+```
+
+## Learn more
+
+- **[Wiki](https://github.com/ryanrudes/fungeom/wiki)** — narrative guides: the core concepts, each
+  layer, and how to add a primitive.
+- **[`docs/reference.md`](docs/reference.md)** — the complete combinator table, architecture, and
+  design notes.
+- **Deep dives** — [`docs/time.md`](docs/time.md), [`docs/collections.md`](docs/collections.md),
+  [`docs/regions.md`](docs/regions.md).
+
+## Development
+
+```bash
+uv pip install -e '.[dev]'
+pytest --cov=fungeom   # tests + 100% coverage gate
+ruff check . && ruff format --check .
+mypy                   # strict
+```
+
+CI runs all four on every push; the same checks are available as pre-commit hooks
+(`pre-commit install && pre-commit install --hook-type pre-push`). Every primitive and combinator,
+with the checks it has passed, is tracked in [`CHECKLIST.md`](CHECKLIST.md).
+
+## License
+
+[Apache-2.0](LICENSE).

fungeom-0.1.0/pyproject.toml

@@ -0,0 +1,85 @@
+[build-system]
+requires = ["hatchling>=1.25", "hatch-vcs>=0.4"]
+build-backend = "hatchling.build"
+
+[project]
+name = "fungeom"
+dynamic = ["version"]                # derived from the latest vX.Y.Z git tag (hatch-vcs)
+description = "Functional geometry as an immutable, decidable resolver graph."
+readme = "README.md"
+requires-python = ">=3.13"
+license = { text = "Apache-2.0" }
+authors = [{ name = "Ryan Rudes" }]
+keywords = ["geometry", "functional", "transforms", "frames", "decidability"]
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "Intended Audience :: Developers",
+    "License :: OSI Approved :: Apache Software License",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.13",
+    "Topic :: Scientific/Engineering :: Mathematics",
+    "Typing :: Typed",
+]
+dependencies = [
+    "numpy>=2.4.6",
+    "scipy>=1.17.1",
+    "rich>=15.0.0",
+    "shapely>=2.0.0",
+]
+
+[project.optional-dependencies]
+dev = [
+  "pytest>=8.2",
+  "pytest-cov>=5.0",
+  "ruff>=0.6",
+  "mypy>=1.11",
+]
+
+[project.urls]
+Repository = "https://github.com/ryanrudes/fungeom"
+Documentation = "https://github.com/ryanrudes/fungeom/wiki"
+Issues = "https://github.com/ryanrudes/fungeom/issues"
+Changelog = "https://github.com/ryanrudes/fungeom/blob/main/CHANGELOG.md"
+
+# Version comes from git tags (hatch-vcs). No tag yet -> fall back to the baseline below, so a
+# tag-less checkout still builds; once a `vX.Y.Z` tag exists it drives the version exactly.
+[tool.hatch.version]
+source = "vcs"
+fallback-version = "0.1.0"
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/fungeom"]
+
+[tool.hatch.build.targets.sdist]
+include = ["src/fungeom", "README.md", "LICENSE", "CHANGELOG.md"]
+
+[tool.ruff]
+line-length = 120
+target-version = "py313"
+exclude = [".venv"]
+
+[tool.mypy]
+python_version = "3.13"
+files = ["src/fungeom", "examples"]
+strict = true
+warn_unreachable = true
+warn_unused_ignores = true
+
+[[tool.mypy.overrides]]
+module = ["scipy.*", "shapely.*"]
+ignore_missing_imports = true
+
+[tool.pytest.ini_options]
+addopts = "-q --import-mode=importlib"
+testpaths = ["tests"]
+pythonpath = ["src"]
+
+[tool.coverage.run]
+source = ["fungeom"]
+
+[tool.coverage.report]
+show_missing = true
+fail_under = 100
+exclude_also = [
+    "if TYPE_CHECKING:",
+]