An Implementation of the 3-Dimensional Extended Persistent Homology Transform

The Extended Persistent Homology Transform (XPHT) describes a shape through the extended persistence diagrams of its directional height functions. We present an algorithm for computing a finite directional sample of the three-dimensional XPHT from a triangulated boundary. Our main construction determines essential first-homology pairings by combining an ordered tree-cotree decomposition with evaluation-dual cocycles. The decomposition supplies a homology basis compatible with the height filtration, while the cocycles are used to determine the essential birth-death pairs. Degree-zero persistence and duality determine the remaining boundary diagrams. Under the boundary-reduction hypotheses and with critical-point sign labels, these diagrams yield the extended persistence of the solid. The resulting procedure uses graph constructions and linear algebra over F2 on boundary meshes extracted from three-dimensional binary images.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20413
Primary Topic
Topological and Geometric Data Analysis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

An Implementation of the 3-Dimensional Extended Persistent Homology Transform

Vanessa Robins, Kiyoshi Takeuchi-Romo
arXiv (Cornell University)
Topological and Geometric Data Analysis
preprint

An Implementation of the 3-Dimensional Extended Persistent Homology Transform

Vanessa Robins, Kiyoshi Takeuchi-Romo
preprint en

Abstract

The Extended Persistent Homology Transform (XPHT) describes a shape through the extended persistence diagrams of its directional height functions. We present an algorithm for computing a finite directional sample of the three-dimensional XPHT from a triangulated boundary. Our main construction determines essential first-homology pairings by combining an ordered tree-cotree decomposition with evaluation-dual cocycles. The decomposition supplies a homology basis compatible with the height filtration, while the cocycles are used to determine the essential birth-death pairs. Degree-zero persistence and duality determine the remaining boundary diagrams. Under the boundary-reduction hypotheses and with critical-point sign labels, these diagrams yield the extended persistence of the solid. The resulting procedure uses graph constructions and linear algebra over F2 on boundary meshes extracted from three-dimensional binary images.

arXiv (Cornell University)
Topological and Geometric Data Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon