{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:07Z","timestamp":1763467927783},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2009,4,16]],"date-time":"2009-04-16T00:00:00Z","timestamp":1239840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s00371-009-0363-z","type":"journal-article","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T15:12:21Z","timestamp":1239808341000},"page":"771-783","source":"Crossref","is-referenced-by-count":3,"title":["Approximate topological matching of quad meshes"],"prefix":"10.1007","volume":"25","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ethan","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rasmus","family":"Tamstorf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,16]]},"reference":[{"key":"363_CR1","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1145\/1201775.882296","volume-title":"SIGGRAPH\u201903: ACM SIGGRAPH 2003 Papers","author":"P. Alliez","year":"2003","unstructured":"Alliez, P., Cohen-Steiner, D., Devillers, O., L\u00e9vy, B., Desbrun, M.: Anisotropic polygonal remeshing. In: SIGGRAPH\u201903: ACM SIGGRAPH 2003 Papers, New York, NY, USA, pp. 485\u2013493. ACM, New York (2003)"},{"key":"363_CR2","unstructured":"Armstrong, C.G., Robinson, D.J., McKeag, R.M., Li, T.S., Bridgett, S.J., Donaghy, R.J.: Applications of the medial axis transform in analysis modelling. In: NAFEMS, Proc. 5th Int. Conf. Reliability of FEM for Engineering Applications, pp. 415\u2013426 (1995)"},{"key":"363_CR3","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G.D. Battista","year":"1998","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall PTR, Upper Saddle River (1998)"},{"key":"363_CR4","doi-asserted-by":"crossref","unstructured":"Baumgart, B.G.: Winged edge polyhedron representation. Technical Report CS-TR-72-320, Stanford University (1972)","DOI":"10.21236\/AD0755141"},{"issue":"4","key":"363_CR5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1142\/S0218195900000206","volume":"10","author":"M.W. Bern","year":"2000","unstructured":"Bern, M.W., Eppstein, D.: Quadrilateral meshing by circle packing. Int. J. Comput. Geom. Appl. 10(4), 347\u2013360 (2000)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"363_CR6","doi-asserted-by":"crossref","unstructured":"Berretti, S., Bimbo, A.D., Pala, P.: A graph edit distance based on node merging. In: Image and Video Retrieval. Lecture Notes in Computer Science, vol. 3115, pp. 464\u2013472 (2004)","DOI":"10.1007\/978-3-540-27814-6_55"},{"key":"363_CR7","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1002\/nme.1620320410","volume":"32","author":"T.D. Blacker","year":"1991","unstructured":"Blacker, T.D., Stephenson, M.B.: Paving: a\u00a0new approach to automated quadrilateral mesh generation. Int. J.\u00a0Numer. Methods Eng. 32, 811\u2013847 (1991)","journal-title":"Int. J.\u00a0Numer. Methods Eng."},{"issue":"8","key":"363_CR8","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H. Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognit. Lett. 18(8), 689\u2013694 (1997)","journal-title":"Pattern Recognit. Lett."},{"key":"363_CR9","unstructured":"Chae, S.-W., Jeong, J.-H.: Unstructured surface meshing using operators. In: Proc. 6th Int. Meshing Roundtable, pp. 281\u2013291 (1997)"},{"key":"363_CR10","doi-asserted-by":"crossref","unstructured":"Cohen-Or, D., Levin, D., Remez, O.: Progressive compression of arbitrary triangular meshes. In: Proc. 10th IEEE Visualization (VIS\u201999), p.\u00a011 (1999)","DOI":"10.1109\/VISUAL.1999.10189410"},{"issue":"1","key":"363_CR11","first-page":"51","volume":"17","author":"D.G. Corneil","year":"1970","unstructured":"Corneil, D.G., Gotlieb, C.C.: An efficient algorithm for graph isomorphism. J.\u00a0ACM 17(1), 51\u201364 (1970)","journal-title":"J.\u00a0ACM"},{"key":"363_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"key":"363_CR13","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1145\/62212.62254","volume-title":"STOC\u201988: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing","author":"H. Fraysseix de","year":"1988","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting F\u00e1ry embeddings of planar graphs. In: STOC\u201988: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 426\u2013433. ACM Press, New York (1988)"},{"key":"363_CR14","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1145\/1179352.1141993","volume-title":"SIGGRAPH \u201906: ACM SIGGRAPH 2006 Papers","author":"S. Dong","year":"2006","unstructured":"Dong, S., Bremer, P.-T., Garland, M., Pascucci, V., Hart, J.C.: Spectral surface quadrangulation. In: SIGGRAPH \u201906: ACM SIGGRAPH 2006 Papers, New York, NY, USA, pp. 1057\u20131066. ACM, New York (2006)"},{"key":"363_CR15","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.: Approximate topological matching of quadrilateral meshes. In: IEEE Int. Conf. on Shape Modeling and Applications (SMI), pp. 83\u201392 (2008)","DOI":"10.1109\/SMI.2008.4547954"},{"issue":"5","key":"363_CR16","doi-asserted-by":"crossref","first-page":"1477","DOI":"10.1111\/j.1467-8659.2008.01288.x","volume":"27","author":"D. Eppstein","year":"2008","unstructured":"Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.: Motorcycle graphs: canonical quad mesh partitioning. Comput. Graph. Forum 27(5), 1477\u20131486 (2008)","journal-title":"Comput. Graph. Forum"},{"issue":"5","key":"363_CR17","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1109\/TPAMI.1986.4767835","volume":"8","author":"M.A. Eshera","year":"1986","unstructured":"Eshera, M.A., Fu, K.S.: An image understanding system using attributed symbolic representation and inexact graph-matching. IEEE Trans. Pattern Anal. Mach. Intell. 8(5), 604\u2013618 (1986)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"363_CR18","doi-asserted-by":"crossref","unstructured":"Feder, T., Motwani, R.: Clique partitions, graph compression and speeding-up algorithms. In: Proc. 23rd ACM Symp. Theory of Computing, pp. 123\u2013133 (1991)","DOI":"10.1145\/103418.103424"},{"key":"363_CR19","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. 41st Symp. Foundations of Computer Science, pp. 390\u2013398 (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"key":"363_CR20","volume-title":"Computers and Intractability: A\u00a0Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A\u00a0Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"363_CR21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/335305.335313","volume-title":"STOC\u201900: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing","author":"M. Grohe","year":"2000","unstructured":"Grohe, M.: Isomorphism testing for embeddable graphs through definability. In: STOC\u201900: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 63\u201372. ACM Press, New York (2000)"},{"key":"363_CR22","doi-asserted-by":"crossref","unstructured":"Gurnhold, S., Strasser, W.: Real time compression of triangle mesh connectivity. In: Proc. 25th Conf. Computer Graphics and Interactive Technology, pp. 133\u2013140 (1998)","DOI":"10.1145\/280814.280836"},{"key":"363_CR23","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs. In: Proc. 6th ACM Symp. Theory of Computing, pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"issue":"3\/4","key":"363_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1006\/gmod.2002.0575","volume":"64","author":"A. Khodakovsky","year":"2002","unstructured":"Khodakovsky, A., Alliez, P., Desbrun, M., Schr\u00f6der, P.: Near-optimal connectivity encoding of 2-manifold polygon meshes. Graph. Models 64(3\/4), 147\u2013168 (2002)","journal-title":"Graph. Models"},{"key":"363_CR25","unstructured":"King, D., Rossignac, J., Szymczak, A.: Connectivity compression for irregular quadrilateral meshes. Technical Report GIT-GVU-99-36, Georgia Institute of Technology (1999)"},{"key":"363_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-3-540-31988-7_25","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S. Marini","year":"2005","unstructured":"Marini, S., Spagnuolo, M., Falcidieno, B.: From exact to approximate maximum common subgraph. In: Graph-Based Representations in Pattern Recognition. Lecture Notes in Computer Science, vol. 3434, pp. 263\u2013272. Springer, Berlin (2005)"},{"key":"363_CR27","doi-asserted-by":"crossref","unstructured":"Miller, G.: Isomorphism testing for graphs of bounded genus. In: Proc. 12th ACM Symp. Theory of Computing, pp. 225\u2013235 (1980)","DOI":"10.1145\/800141.804670"},{"key":"363_CR28","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/800105.803404","volume-title":"STOC\u201977: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing","author":"G.L. Miller","year":"1977","unstructured":"Miller, G.L.: Graph isomorphism, general remarks. In: STOC\u201977: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 143\u2013150. ACM Press, New York (1977)"},{"key":"363_CR29","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B. Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins University Press, Baltimore (2001)"},{"key":"363_CR30","unstructured":"M\u00fcller-Hannemann, M.: High quality quadrilateral surface meshing without template restrictions: a\u00a0new approach based on network flow techniques. In: Proc. 6th Int. Meshing Roundtable, pp. 293\u2013307 (1997)"},{"issue":"1","key":"363_CR31","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"N. Neuhaus","year":"2007","unstructured":"Neuhaus, N., Bunke, H.: Automatic learning of cost functions for graph edit distance. Inf. Sci. 177(1), 239\u2013247 (2007)","journal-title":"Inf. Sci."},{"key":"363_CR32","unstructured":"Nowottny, D.: Quadrilateral mesh generation via geometrically optimized domain decomposition. In: Proc. 6th Int. Meshing Roundtable, pp. 309\u2013320 (1997)"},{"issue":"3","key":"363_CR33","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/1276377.1276446","volume":"26","author":"J. Palacios","year":"2007","unstructured":"Palacios, J., Zhang, E.: Rotational symmetry field design on surfaces. ACM Trans. Graph. 26(3), 55 (2007)","journal-title":"ACM Trans. Graph."},{"key":"363_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"issue":"4","key":"363_CR35","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1145\/1183287.1183297","volume":"25","author":"N. Ray","year":"2006","unstructured":"Ray, N., Li, W.C., L\u00e9vy, B., Sheffer, A., Alliez, P.: Periodic global parameterization. ACM Trans. Graph. 25(4), 1460\u20131485 (2006)","journal-title":"ACM Trans. Graph."},{"key":"363_CR36","first-page":"138","volume-title":"SODA\u201990: Proceedings of the First Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"W. Schnyder","year":"1990","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA\u201990: Proceedings of the First Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 138\u2013148. Society for Industrial and Applied Mathematics, Philadelphia (1990)"},{"key":"363_CR37","unstructured":"Schonfeld, T., Weinerfelt, P.E.R.: The automatic generation of quadrilateral multi-block grids by the advancing front technique. In: Numerical Grid Generation in Computational Fluid Dynamics and Related Fields; Proceedings of the 3rd International Conference, Barcelona, Spain, pp. 743\u2013754 (1991)"},{"key":"363_CR38","unstructured":"Shimada, K., Liao, J.-H., Itoh, T.: Quadrilateral meshing with directionality control through the packing of square cells. In: Proc. 7th Int. Meshing Roundtable, pp. 61\u201375 (1998)"},{"issue":"5","key":"363_CR39","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/38.232097","volume":"13","author":"B.C. Smith","year":"1993","unstructured":"Smith, B.C., Rowe, L.A.: Algorithms for manipulating compressed images. Comput. Graph. Appl. 13(5), 34\u201342 (1993)","journal-title":"Comput. Graph. Appl."},{"key":"363_CR40","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1002\/nme.1620290712","volume":"29","author":"J.A. Talbert","year":"1991","unstructured":"Talbert, J.A., Parkinson, A.R.: Development of an automatic two-dimensional finite element mesh generator using quadrilateral elements and Bezier curve boundary definition. Int. J. Numer. Methods Eng. 29, 1551\u20131567 (1991)","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"2","key":"363_CR41","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/274363.274365","volume":"17","author":"G. Taubin","year":"1998","unstructured":"Taubin, G., Rossignac, J.: Geometric compression through topological surgery. ACM Trans. Graph. 17(2), 84\u2013115 (1998)","journal-title":"ACM Trans. Graph."},{"key":"363_CR42","unstructured":"Tong, Y., Alliez, P., Cohen-Steiner, D., Desbrun, M.: Designing quadrangulations with discrete harmonic forms. In: SGP\u201906: Proceedings of the Fourth Eurographics Symposium on Geometry Processing, Aire-la-Ville, Switzerland, pp. 201\u2013210. Switzerland Eurographics Association (2006)"},{"key":"363_CR43","unstructured":"Touma, C., G.C.: Triangle mesh compression. In: Proc. Graphics Interface, pp. 26\u201334 (1998)"},{"key":"363_CR44","first-page":"117","volume":"13","author":"D.R. Wood","year":"2007","unstructured":"Wood, D.R., Telle, J.A.: Planar decompositions and the crossing number of graphs with an excluded minor. N.\u00a0Y.\u00a0J.\u00a0Math. 13, 117\u2013146 (2007)","journal-title":"N.\u00a0Y.\u00a0J.\u00a0Math."},{"issue":"6","key":"363_CR45","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/76.475896","volume":"5","author":"B.-L. Yeo","year":"1995","unstructured":"Yeo, B.-L., Liu, B.: Rapid scene analysis on compressed video. IEEE Trans. Circuits Syst. Video Technol. 5(6), 533\u2013544 (1995)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-009-0363-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-009-0363-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-009-0363-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:44:38Z","timestamp":1710261878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-009-0363-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,16]]},"references-count":45,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["363"],"URL":"https:\/\/doi.org\/10.1007\/s00371-009-0363-z","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,16]]}}}