Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

I/O-Efficient Contour Tree Simplification

From MaRDI portal
Publication:3652300
Jump to:navigation, search

DOI10.1007/978-3-642-10631-6_116zbMath1273.68399OpenAlexW1491965887MaRDI QIDQ3652300

Morten Revsbæk, Lars Arge

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_116



Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)


Related Items

Computational Topology via Functional Programming: A Baseline Analysis




This page was built for publication: I/O-Efficient Contour Tree Simplification

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3652300&oldid=17106821"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 07:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki