Approximate topological matching of quadrilateral meshes

IEEE International Conference on Shape Modeling and Applications 2008, Proceedings, SMI

Volumn , Issue , 2008, Pages 83-92

  Eppstein, David ^a   Goodrich, Michael T ^a   Kim, Ethan ^b   Tamstorf, Rasmus ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MCGILL UNIVERSITY   (Canada)

^c DISNEY RESEARCH   (United States)

Author keywords

F.2.2 analysis of algorithms and problem complexity : nonnumerical algorithms and problems geometrical problems and computations; I.3.5 computer graphics : computational geometry and object modeling boundary representations

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; BOOLEAN FUNCTIONS; NUCLEAR PROPULSION; SET THEORY;

F.2.2 [ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY]: NONNUMERICAL ALGORITHMS AND PROBLEMS - GEOMETRICAL PROBLEMS AND COMPUTATIONS; I.3.5 [COMPUTER GRAPHICS]: COMPUTATIONAL GEOMETRY AND OBJECT MODELING - BOUNDARY REPRESENTATIONS; QUADRILATERAL MESHING; SHAPE MODELLING;

APPLICATIONS;

EID: 51149103496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2008.4547954     Document Type: Conference Paper

References (38)

1. C. G. Armstrong, D. J. Robinson, R. M. McKeag, T. S. Li, S. J. Bridgett, and R. J. Donaghy. Applications of the medial axis transform in analysis modelling. In NAFEMS, Proc. 5th Int. Conf. Reliability of FEM for Engineering Applications, pages 415-426, 1995.
2. G. D. Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, Upper Saddle River, NJ, USA, 1998.
3. B. G. Baumgart. Winged edge polyhedron representation. Technical Report CS-TR-72-320, Stanford University, 1972.
4. M. W. Bern and D. Eppstein. Quadrilateral meshing by circle packing. Int. J. Computational Geometry and Applications, 10(4):347-360, 2000.
5. S. Berretti, A. D. Bimbo, and P. Pala. A graph edit distance based on node merging. In Image and Video Retrieval, volume 3115 of Lecture Notes in Computer Science, pages 464-472, 2004.
6. T. D. Blacker and M. B. Stephenson. Paving: a new approach to automated quadrilateral mesh generation. Int. J. Numerical Methods in Engineering, 32:811-847, 1991.
7. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18(8):689-694, 1997.
8. S.-W. Chae and J.-H. Jeong. Unstructured surface meshing using operators. In Proc. 6th Int. Meshing Roundtable, pages 281-291, 1997.
9. D. Cohen-Or, D. Levin, and O. Remez. Progressive compression of arbitrary triangular meshes. In Proc. 10th IEEE Visualization (VIS '99), page 11, 1999.
10. D. G. Corneil and C. C. Gotlieb. An efficient algorithm for graph isomorphism. J. ACM, 17(1):51-64, 1970.
11. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.
12. H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting fary embeddings of planar graphs. In STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 426-433, New York, NY, USA, 1988. ACM Press.
13. M. A. Eshera and K. S. Fu. An image understanding system using attributed symbolic representation and inexact graph-matching. IEEE Trans. Pattern Anal. Mach. Intell., 8(5):604-618, 1986.
14. T. Feder and R. Motwani. Clique partitions, graph compression and speeding-up algorithms. In Proc. 23rd ACM Symp. Theory of Computing, pages 123-133, 1991.
15. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proc. 41st Symp. Foundations of Computer Science, pages 390-398, 2000.
16. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
17. M. Grohe. Isomorphism testing for embeddable graphs through definability. In STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 63-72, New York, NY, USA, 2000. ACM Press.
18. S. Gurnhold and W. Strasser. Real time compression of triangle mesh connectivity. In Proc. 25th Conf. Computer Graphics and Interactive Technology, pages 133-140, 1998.
19. J. E. Hopcroft and J. K. Wong. Linear time algorithm for isomorphism of planar graphs. In Proc. 6th ACM Symp. Theory of Computing, pages 172-184, 1974.
20. A. Khodakovsky, P. Alliez, M. Desbrun, and P. Schröder. Near-optimal connectivity encoding of 2-manifold polygon meshes. Graph. Models, 64(3/4):147-168, 2002.
21. D. King, J. Rossignac, and A. Szymczak. Connectivity compression for irregular quadrilateral meshes. Technical Report GIT-GVU-99-36, Georgia Institute of Technology, 1999.
22. S. Marini, M. Spagnuolo, and B. Falcidieno. From exact to approximate maximum common subgraph. In Graph-Based Representations in Pattern Recognition, pages 263-272. Springer-Verlag, Lecture Notes in Computer Science 3434, 2005.
23. G. Miller. Isomorphism testing for graphs of bounded genus. In Proc. 12th ACM Symp. Theory of Computing, pages 225-235, 1980.
24. G. L. Miller. Graph isomorphism, general remarks. In STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computing, pages 143-150, New York, NY, USA, 1977. ACM Press.
25. B. Mohar and C. Thomassen. Graphs on Surfaces. Johns Hopkins University Press, 2001.
26. M. Müller-Hannemann. High quality quadrilateral surface meshing without template restrictions: a new approach based on network flow techniques. In Proc. 6th Int. Meshing Roundtable, pages 293-307, 1997.
27. N. Neuhaus and H. Bunke. Automatic learning of cost functions for graph edit distance. Information Science, 177(1):239-247, 2007.
28. D. Nowottny. Quadrilateral mesh generation via geometrically optimized domain decomposition. In Proc. 6th Int. Meshing Roundtable, pages 309-320, 1997.
29. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, NY, 1985.
30. W. Schnyder. Embedding planar graphs on the grid. In SODA '90: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pages 138-148, Philadelphia, PA, USA, 1990. Society for Industrial and Applied Mathematics.
31. T. Schonfeld and P. E. R. Weinerfelt. 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, pages 743-754, 1991.
32. K. Shimada, J.-H. Liao, and T. Itoh. Quadrilateral meshing with directionality control through the packing of square cells. In Proc. 7th Int. Meshing Roundtable, pages 61-75, 1998.
33. B. C. Smith and L. A. Rowe. Algorithms for manipulating compressed images. Computer Graphics and Applications, 13(5):34-42, 1993.
34. J. A. Talbert and A. R. Parkinson. Development of an automatic two-dimensional finite element mesh generator using quadrilateral elements and Bezier curve boundary definition. Int. J. Numerical Methods in Engineering, 29:1551-1567, 1991.
35. G. Taubin and J. Rossignac. Geometric compression through topological surgery. ACM Trans. Graphics, 17(2):84-115, 1998.
36. C. Touma and G. C. Triangle mesh compression. In Proc. Graphics Interface, pages 26-34, 1998.
37. D. R. Wood and J. A. Telle. Planar decompositions and the crossing number of graphs with an excluded minor. New York Journal of Mathematics, 13:117-146, 2007.
38. B.-L. Yeo and B. Liu. Rapid scene analysis on compressed video. IEEE Trans. Circuits and Systems for Video Technology, 5(6):533-544, 1995.