Skip to content
Universidad del Mar SIBUMAR Descubridor Institucional UMAR
  • Inicio
  • Búsqueda avanzada
  • Explorar
  • Login
    • English
    • Deutsch
    • Español
    • Français
    • Italiano
Advanced
  • Lagrangian Simulation Volume-Based Contour Tree Simplification
Cover Image

Lagrangian Simulation Volume-Based Contour Tree Simplification

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Dilys, Domantas, Carr, Hamish, Boeing, Steven
Format: Preprint
Published: 2025
Subjects:
Computational Geometry
Distributed, Parallel, and Cluster Computing
Data Structures and Algorithms
Online Access:
Acceder al recurso
Tags: Add Tag
No Tags, Be the first to tag this record!
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Save to List
  • Permanent link
  • Holdings
  • Description
  • Comments
  • Similar Items
  • Staff View

Internet

https://arxiv.org/abs/2508.14339

Similar Items

  • Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification
    by: Li, Mingzhe, et al.
    Published: (2025)
  • A Surprisingly Simple Method for Distributed Euclidean-Minimum Spanning Tree / Single Linkage Dendrogram Construction from High Dimensional Embeddings via Distance Decomposition
    by: Lettich, Richard
    Published: (2024)
  • Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
    by: Raulet, Gabriel, et al.
    Published: (2025)
  • Composable Coresets for Constrained Determinant Maximization and Beyond
    by: Mahabadi, Sepideh, et al.
    Published: (2022)
  • Restructuring expression dags for efficient parallelization
    by: Wilhelm, Martin
    Published: (2018)
Universidad del Mar
Universidad del MarSistema Bibliotecario de la Universidad del MarDescubridor Institucional UMARImplementación y desarrollo: Mtro. Carlos Alonso Albores Pérez
InicioBúsqueda avanzadaExplorar
Visitas al Descubridor: 33,245© 2026 Universidad del Mar