Sciweavers

Share
CGF
2008

Motorcycle Graphs: Canonical Quad Mesh Partitioning

8 years 7 months ago
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
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CGF
Authors David Eppstein, Michael T. Goodrich, Ethan Kim, Rasmus Tamstorf
Comments (0)
books