Correction to: ``Avoiding the global sort: a faster contour tree algorithm

DOI10.1007/S00454-022-00417-5zbMATH Open1503.68282OpenAlexW4292651858WikidataQ114229293 ScholiaQ114229293MaRDI QIDQ2679593FDOQ2679593

Authors: Benjamin Raichel, C. Seshadhri 

Publication date: 23 January 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-022-00417-5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Avoiding the global sort: a faster contour tree algorithm

This page was built for publication: Correction to: ``Avoiding the global sort: a faster contour tree algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679593)