{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:34:41Z","timestamp":1781217281527,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540886051","type":"print"},{"value":"9783540886068","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-88606-8_5","type":"book-chapter","created":{"date-parts":[[2009,2,5]],"date-time":"2009-02-05T08:46:47Z","timestamp":1233823607000},"page":"59-73","source":"Crossref","is-referenced-by-count":23,"title":["Representing Interpolant Topology for Contour Tree Computation"],"prefix":"10.1007","author":[{"given":"Hamish","family":"Carr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1_5","doi-asserted-by":"crossref","unstructured":"C. L. Bajaj, V. Pascucci, and D. R. Schikore. The Contour Spectrum. In P roceedin gs of Visualization 1997, pages 167\u2013173, 1997.","DOI":"10.1109\/VISUAL.1997.663875"},{"issue":"2","key":"5_CR2_5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TVCG.2004.1260765","volume":"10","author":"P. Bhaniramka","year":"2004","unstructured":"P. Bhaniramka, R. Wenger, and R. A. Crawfis. Isosurface Construction in Any Dimension Using Convex Hulls. IEEE Transactions on Visualization and Computer Graphics, 10(2):130\u2013141, 2004.","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"5_CR3_5","doi-asserted-by":"crossref","unstructured":"R. L. Boyell and H. Ruston. Hybrid Techniques for Real-time Radar Simulation. In Proceedi ngs of the 1963 Fall Joint Computer Conference, pages 445\u2013458. IEEE, 1963.","DOI":"10.1145\/1463822.1463869"},{"key":"5_CR4_5","doi-asserted-by":"crossref","unstructured":"H. Carr, T. M\u00f6ller, and J. Snoeyink. Simplicial Subdivisions and Sampling Artifacts. In Proceedi ngs of V i su alizati on 2001, pages 99\u2013106, 2001.","DOI":"10.1109\/VISUAL.2001.964499"},{"key":"5_CR5_5","first-page":"49","volume":"285","author":"H. Carr","year":"2003","unstructured":"H. Carr and J. Snoeyink. Path Seeds and Flexible Isosurfaces: Using Topol ogy for Exploratory Visualization. In Proceedings of Eurographics Visualization Symposium 2003, pages 49\u201358, 285, 2003.","journal-title":"In Proceedings of Eurographics Visualization Symposium 2003"},{"issue":"2","key":"5_CR6_5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0925-7721(02)00093-7","volume":"24","author":"H. Carr","year":"2003","unstructured":"H. Carr, J. Snoeyink, and U. Axen. Computing Contour Trees in All Dimensions. Computational Geometry: Theory and Applications, 24(2):75\u201394, 2003.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"5_CR7_5","doi-asserted-by":"crossref","unstructured":"H. Carr, J. Snoeyink, and M. van de Panne. Simplifying Flexible Isosurfaces with Local Geometric Measures. In Proceedings of Visualization 2004, pages 497\u2013504, 2004.","DOI":"10.1109\/VISUAL.2004.96"},{"key":"5_CR8_5","first-page":"39","volume":"284","author":"H. Carr","year":"2003","unstructured":"H. Carr, T. Theu\u03b2l, and T. M\u00f6ller. Isosurfaces on Optimal Regular Samples. In Proceedings of Eurographics Visualization Symposium 2003, pages 39\u201348, 284, 2003.","journal-title":"In Proceedings of Eurographics Visualization Symposium 2003"},{"key":"5_CR9_5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.comgeo.2004.05.002","volume":"30","author":"Y.-J. Chiang","year":"2005","unstructured":"Y.-J. Chiang, T. Lenz, X. Lu, and G. Rote. Simple and Optimal Output-Sensitive Construction of Contour Trees Using Monotone Paths. Computational Geometry: Theory and Applications, 30:165\u2013195, 2005.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"5_CR10_5","doi-asserted-by":"crossref","unstructured":"Y.-J. Chiang and X. Lu. Progressive Simplification of Tetrahedral Meshes Preserving All Isosurface Topologies. Computer Graphics Forum, 22(3), 2003.","DOI":"10.1111\/1467-8659.00697"},{"issue":"4","key":"5_CR11_5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/378456.378484","volume":"22","author":"M. D\u00fcrst","year":"1988","unstructured":"M. D\u00fcrst. Letters: Additional Reference to \u201cMarching Cubes\u201d. Computer Graphics, 22(4):65\u201374, 1988.","journal-title":"Computer Graphics"},{"key":"5_CR12_5","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, J. Harer, and A. Zomorodian. Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds. In Proceedings of the 17th AC M Symposi um on Computational Geometry, pages 70\u201379. ACM, 2001.","DOI":"10.1145\/378583.378626"},{"issue":"1","key":"5_CR13_5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0016-0032(67)90568-6","volume":"284","author":"H. Freeman","year":"1967","unstructured":"H. Freeman and S. Morse. On Searching A Contour Map for a Given Terrain Elevation Profile. Journal of the Franklin Institute, 284(1):1\u201325, 1967.","journal-title":"Journal of the Franklin Institute"},{"issue":"1\u20132","key":"5_CR14_5","first-page":"97","volume":"25","author":"L. Kettner","year":"2001","unstructured":"L. Kettner, J. Rossignac, and J. Snoeyink. The Safari Interface for Visual izing Time-Dependent Volume Data Using Iso-surfaces and Contour Spectra. Computational Geometry: Theory and Applications, 25(1\u20132):97\u2013116, 2001.","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"5_CR15_5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TVCG.2003.1175094","volume":"9","author":"A. Lopes","year":"2003","unstructured":"A. Lopes and K. Brodlie. Improving the robustness and accuracy of the march ing cubes algorithm for isosurfacing. IEEE Transactions on Visualization and Computer Graphics, 9(1):16\u201329, 2003.","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"4","key":"5_CR16_5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/37402.37422","volume":"21","author":"W. E. Lorenson","year":"1987","unstructured":"W. E. Lorenson and H. E. Cline. Marching Cubes: A High Resolution 3D Surface Construction Algorithm. Computer Graphics, 21(4):163\u2013169, 1987.","journal-title":"Computer Graphics"},{"key":"5_CR17_5","doi-asserted-by":"crossref","DOI":"10.1515\/9781400881802","volume-title":"Morse Theory","author":"J. Milnor","year":"1963","unstructured":"J. Milnor. Morse Theory. Princeton University Press, Princeton, NJ, 1963."},{"key":"5_CR18_5","doi-asserted-by":"crossref","unstructured":"S. Mizuta and T. Matsuda. Description of the Topological Structure of Digital Images by Region-based Contour Tree and Its Application. Technical report, Institute of Electronics, Information and Communication Engineers, 2004.","DOI":"10.1007\/11559573_68"},{"key":"5_CR19_5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01900830","volume":"10","author":"C. Montani","year":"1994","unstructured":"C. Montani, R. Scateni, and R. Scopigno. A modified look-up table for implicit disambiguation of Marching Cubes. Visual Computer, 10:353\u2013355, 1994.","journal-title":"Visual Computer"},{"key":"5_CR20_5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01900699","volume":"11","author":"B. Natarajan","year":"1994","unstructured":"B. Natarajan. On generating topologically consistent isosurfaces from uniform samples. Visual Computer, 11:52\u201362, 1994.","journal-title":"Visual Computer"},{"issue":"3","key":"5_CR21_5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/TVCG.2003.1207437","volume":"9","author":"G. M. Nielson","year":"2003","unstructured":"G. M. Nielson. On Marching Cubes. IEEE Transactions on Visualization and Computer Graphics, 9(3):283\u2013297, 2003.","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"5_CR22_5","doi-asserted-by":"crossref","unstructured":"G. M. Nielson and B. Hamann. The Asymptotic Decider: Resolving the Ambi guity in Marching Cubes. In P roceedings of Visualization 1991, pages 83\u201391. IEEE, 1991.","DOI":"10.1109\/VISUAL.1991.175782"},{"key":"5_CR23_5","unstructured":"V. Pascucci. On the Topology of the Level Sets of a Scalar Field. In Abstracts of the 13th Canadian Conference on Computational Geometry, pages 141\u2013144, 2001."},{"issue":"2","key":"5_CR24_5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-003-1052-3","volume":"38","author":"V. Pascucci","year":"2003","unstructured":"V. Pascucci and K. Cole-McLaughlin. Parallel Computation of the Topology of Level Sets. Algorithmica, 38(2):249\u2013268, 2003.","journal-title":"Algorithmica"},{"key":"5_CR25_5","first-page":"847","volume":"222","author":"G. Reeb","year":"1946","unstructured":"G. Reeb. Sur les points singuliers d'une forme de Pfaff compl\u00e8tement int\u00e9grable ou d'une fonction num\u00e9rique. Comptes Rendus de l'Acad\u00e8mie des Sciences de Paris, 222:847\u2013849, 1946.","journal-title":"Comptes Rendus de l'Acad\u00e8mie des Sciences de Paris"},{"key":"5_CR26_5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/38.90568","volume":"11","author":"Y. Shinagawa","year":"1991","unstructured":"Y. Shinagawa, T. L. Kunii, and Y. L. Kergosien. Surface Coding Based on Morse Theory. IEEE Computer Graphics and Applications, 11:66\u201378, September 1991.","journal-title":"IEEE Computer Graphics and Applications"},{"issue":"3","key":"5_CR27_5","doi-asserted-by":"publisher","first-page":"C","DOI":"10.1111\/1467-8659.1430181","volume":"14","author":"S. Takahashi","year":"1995","unstructured":"S. Takahashi, T. Ikeda, Y. Shinagawa, T. L. Kunii, and M. Ueda. Algorithms for Extracting Correct Critical Points and Constructing Topological Graphs from Discrete Geographical Elevation Data. Computer Graphics Forum, 14(3):C\u2013 181-C-192, 1995.","journal-title":"Computer Graphics Forum"},{"issue":"1","key":"5_CR28_5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.gmod.2003.08.002","volume":"66","author":"S. Takahashi","year":"2004","unstructured":"S. Takahashi, Y. Takeshima, and I. Fujishiro. Topological volume skeletonization and its application to transfer function design. Graphical Models, 66(1):24\u201349, 2004.","journal-title":"Graphical Models"},{"key":"5_CR29_5","doi-asserted-by":"crossref","unstructured":"S. P. Tarasov and M. N. Vyalyi. Construction of Contour Trees in 3D in O(n log n) steps. In Proceedings of the 14th ACM Symposium on Computational Geometry, pages 68\u201375, 1998.","DOI":"10.1145\/276884.276892"},{"key":"5_CR30_5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. E. Tarjan","year":"1975","unstructured":"R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22:215\u2013225, 1975.","journal-title":"Journal of the ACM"},{"key":"5_CR31_5","doi-asserted-by":"crossref","unstructured":"M. van Kreveld, R. van Oostrum, C. L. Bajaj, V. Pascucci, and D. R. Schikore. Contour Trees and Small Seed Sets for Isosurface Traversal. In Proceedi ngs of the 13th ACM Symposium on Computational Geometry, pages 212\u2013220, 1997.","DOI":"10.1145\/262839.269238"},{"key":"5_CR32_5","unstructured":"G. Weber, S. Dillard, H. Carr, V. Pascucci, and B. Hamann. Topology-based, flexible volume rendering. To appear in IEEE Transactions on Visualization and Computer Graphics, 2007."},{"key":"5_CR33_5","unstructured":"X. Zhang, C. L. Bajaj, and N. Baker. Fast Matching of Volumetric Functions Using Multi-resolution Dual Contour Trees. Technical report, Texas Institute for Computational and Applied Mathematics, Austin, Texas, 2004."}],"container-title":["Mathematics and Visualization","Topology-Based Methods in Visualization II"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88606-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T11:38:32Z","timestamp":1738928312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88606-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540886051","9783540886068"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88606-8_5","relation":{},"ISSN":["1612-3786"],"issn-type":[{"value":"1612-3786","type":"print"}],"subject":[],"published":{"date-parts":[[2009]]}}}