Motorcycle graphs: Canonical quad mesh partitioning

Eurographics Symposium on Geometry Processing

Volumn 27, Issue 5, 2008, Pages 1477-1486

  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

[No Author keywords available]

Indexed keywords

EID: 78751520368     PISSN: 17278384     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. BAUMGART B. G.: Winged edge polyhedron representation. Tech. Rep. CS-TR-72-320, Stanford University 1972.
2. COHEN-OR D., LEVIN D., REMEZ O.: Progressive compression of arbitrary triangular meshes. In Proc. 10th IEEE Visualization Conf. (1999), p. 11.
3. CHENG S.-W., VIGNERON A.: Motorcycle graphs and straight skeletons. Algorithmica 47, 2 (2007), 159-182.
4. DEERING M.: Geometry compression. In Proc. 22nd SIGGRAPH (1995), pp. 13-20.
5. EPPSTEIN D., ERICKSON J.: Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions. Discrete and Computational Geometry 22, 4 (1999), 569-592.
6. EPPSTEIN D., GOODRICH M. T., KIM E., TAMSTORF R.: Approximate topological matching of quadrilateral meshes. In Proc. Shape Modeling International (2008). To appear.
7. EPPSTEIN D., VAN KREVELD M., MUMFORD E., SPECKMANN B.: Edges and switches, tunnels and bridges. In Proc. 10th. Int. Worksh. Algorithms and Data Structures (2007), Springer-Verlag, Lecture Notes in Computer Science 4619, pp. 77-88.
8. FILOTTI I. S., MAYER J. N.: A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. In Proc. 12th ACM Symp. Theory of Computing (1980), pp. 236-24.
9. FRAYSSEIX H. D., PACH J., POLLACK R.: How to draw a planar graph on a grid. Combinatorica 10, 1 (1990), 41-51.
10. GU X., GORTLER S. J., HOPPE H.: Geometry images. In Proc. 29th SIGGRAPH (2002), pp. 355-361.
11. GAREY M. R., JOHNSON D. S.: The rectilinear steiner tree problem is NP-complete. SIAM J. Applied Mathematics 32, 4 (1977), 826-834.
12. GAREY M. R., JOHNSON D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
13. GROHE M.: Isomorphism testing for embeddable graphs through definability. In Proc. 32nd ACM Symp. Theory of Computing (2000), pp. 63-72.
14. GURNHOLD S., STRASSER W.: Real time compression of triangle mesh connectivity. In Proc. 25th SIGGRAPH (1998), pp. 133-140.
15. HOPCROFT J. E., WONG J. K.: Linear time algorithm for isomorphism of planar graphs. In Proc. 6th ACM Symp. Theory of Computing (1974), pp. 172-184.
16. IMAI H., ASANO T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4 (1983), 310-323.
17. KING D., ROSSIGNAC J., SZYMCZAK A.: Connectivity compression for irregular quadrilateral meshes. Tech. Rep. GIT-GVU-99-36, Georgia Institute of Technology, 1999.
18. MILLER G.: Isomorphism testing for graphs of bounded genus. In Proc. 12th ACM Symp. Theory of Computing (1980), pp. 225-235.
19. OHTSUKI T.: Minimum dissection of rectilinear regions. In Proc. Int. Symp. Circuits And Systems (ISCAS) (1982), pp. 1210-1213.
20. SCHNYDER W.: Embedding planar graphs on the grid. In Proc. 1st Annual ACM-SIAM Symp. Discrete Algorithms (1990), pp. 138-148.
21. SIEK J., LEE L.-Q., LUMSDAINE A.: The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, 2002.
22. TOUMA C., GOTSMAN C.: Triangle mesh compression. In Proc. Graphics Interface (1998), pp. 26-34.
23. TAUBIN G., ROSSIGNAC J.: Geometric compression through topological surgery. ACM Trans. Graphics 17, 2 (1998), 84-115. 1