Avoiding the global sort: a faster contour tree algorithm

DOI10.4230/LIPICS.SOCG.2016.57zbMATH Open1387.68275OpenAlexW2908004162MaRDI QIDQ3132893FDOQ3132893

Authors: Benjamin Raichel, C. Seshadhri 

Publication date: 30 January 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2016.57

Recommendations

• Avoiding the global sort: a faster contour tree algorithm
• Parallel computation of the topology of level sets
• Simple and optimal output-sensitive construction of contour trees using monotone paths
• Maintaining contour trees of dynamic terrains
• I/O-efficient contour tree simplification

zbMATH Keywords

computational geometrycomputational topologycontour trees

Mathematics Subject Classification ID

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

Cited In (1)

• Parallel computation of the topology of level sets

This page was built for publication: 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 Q3132893)