Motorcycle Graphs: Canonical Quad Mesh Partitioning

We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein and Erickson to quad meshes. Our partitions may be used to efficiently find isomorphisms between quad meshes. In addition, they may be used as a highly compressed representation of the original mesh. These partitions can be constructed in sublinear time from a list of the extraordinary vertices in a mesh. We also study the problem of further reducing the number of submeshes in our partitions--we prove that optimizing this number is NP-hard, but it can be efficiently approximated. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Boundary representations

• Type: Journal
• Year: 2008
• Where: CGF
• Authors: David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf
• Keywords: CGF 2008, Geometric Motorcycle Graph, Quad Meshes, Semi-regular Quadrilateral Meshes