Published in

Royal Society of Chemistry, Digital Discovery, 2(3), p. 392-409, 2024

DOI: 10.1039/d3dd00226h

Links

Tools

Export citation

Search in Google Scholar

A fast and scalable computational topology framework for the Euler characteristic

Journal article published in 2024 by Daniel J. Laky ORCID, Victor M. Zavala
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Red circle
Preprint: archiving forbidden
Green circle
Postprint: archiving allowed
Upload
Green circle
Published version: archiving allowed
Upload
Policy details
Data provided by SHERPA/RoMEO

Abstract

Parallel algorithms exploit structure to compute the Euler characteristic (a powerful topological descriptor that is used to quantify shape of data) at significantly less computational expense than traditional software tools.