arXiv (All)
open access
EXaCTz: Guaranteed Extremum Graph and Contour Tree Preservation for Distributed- and GPU-Parallel Lossy Compression
This paper introduces EXaCTz, a parallel algorithm that corrects lossy-compressed scalar field data to preserve extremum graphs and contour trees concurrently. While error-bounded lossy compression is essential for large-scale scientific simulations and workflows, existing topology-preserving method
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fast Differentiable SVD on GPU via Polar Decomposition#1116836
- SOLANET: Distributed Neighbor Graph Construction on GPU-Accelerated Systems#238582
- Compressed-Resident Genomics: Full-Pipeline Device-Resident GPU LZ77 Decode with Position-Invariant Random Access#287099
- The Class Edge-Reconstruction Number of a Maximal Planar Graph Is One or Two#924273
- The Class Edge-Reconstruction Number of a Maximal Planar Graph Is One or Two#920042
Record · ID 1062881
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive