Package: wkpool 0.3.0

Michael Sumner

wkpool: Vertex Pool Topology for Well-Known Geometry

Establishes and maintains vertex pool topology for geometry handled by 'wk'. Segments are the atomic unit, vertices are shared via integer references into a pool. Topology is made discoverable via coincident vertex detection while not requiring modification of the input data. Topological data models follow principles described in Worboys and Duckham (2004, ISBN:978-0415283755). The edge-based topology geometry decomposed into vertices and directed edge pairs is a simplification of the quad-edge case in Guibas & Stolfi (1985) <doi:10.1145/282918.282923>.

Authors:Michael Sumner [aut, cre]

wkpool_0.3.0.tar.gz
wkpool_0.3.0.zip(r-4.7)wkpool_0.3.0.zip(r-4.6)wkpool_0.3.0.zip(r-4.5)
wkpool_0.3.0.tgz(r-4.6-any)wkpool_0.3.0.tgz(r-4.5-any)
wkpool_0.3.0.tar.gz(r-4.7-any)wkpool_0.3.0.tar.gz(r-4.6-any)
wkpool_0.3.0.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION |NEWS
card.svg |card.png
wkpool/json (API)

# Install 'wkpool' in R:
install.packages('wkpool', repos = c('https://hypertidy.r-universe.dev', 'https://cloud.r-project.org'))

Bug tracker:https://github.com/hypertidy/wkpool/issues

On CRAN:

Conda:

5.38 score 6 stars 6 scripts 460 downloads 28 exports 6 dependencies

Last updated from:6545b12641. Checks:9 OK. Indexed: yes.

TargetResultTimeFilesSyslog
linux-devel-x86_64OK106
source / vignettesOK182
linux-release-x86_64OK126
macos-release-arm64OK101
macos-oldrel-arm64OK100
windows-develOK92
windows-releaseOK74
windows-oldrelOK77
wasm-releaseOK114

Exports:arc_node_summaryarcs_to_wkbarcs_to_wktas_arcsas_pslgclassify_cyclescycle_signed_areacycles_to_wkbcycles_to_wktestablish_topologyfind_arcsfind_cyclesfind_internal_boundariesfind_neighboursfind_nodesfind_shared_edgeshole_pointsmerge_coincidentpool_combinepool_compactpool_featurepool_segmentspool_verticesreverse_cyclesegments_to_wkbsegments_to_wkttopology_reportvertex_degree

Dependencies:cligluelifecyclerlangvctrswk

Segments: the atoms of geometry
What is a segment? | The cost of sealed geometry | What becomes easy | The full topology | Cycles and winding | The round trip | Integration: triangulation | Segments in movement data | Why this matters now | The lineage | Further reading
Rendered fromwkpool-vignette-segments.Rmdusingknitr::rmarkdown

Last update: 2026-02-28
Started: 2026-02-28

wkpool: Topology-based Geometry Handling
Why topology? | Basic workflow | Establish topology | Inspect the raw state | Access the pool components | Merge coincident vertices | Adjacency discovery | Shared edges | Internal boundaries | Neighbour graph | Ring and cycle analysis | Find closed cycles | Classify by winding | Arc-node topology | Round-trip to WKT | Triangulation integration | RTriangle (PSLG) | Subsetting and combining | Visualization | Related Work | Core topology/vertex-pool (hypertidy ecosystem) | Mesh/triangulation | Adjacency (computed, not stored)
Rendered fromwkpool.Rmdusingknitr::rmarkdown

Last update: 2026-02-28
Started: 2026-02-28