Extended graph rotation systems as a model for cyclic weaving on orientable surfaces
نویسندگان
چکیده
We present an extension of the theory of graph rotation systems, which has been a widely used model for graph imbeddings on topological surfaces. The extended model is quite beyond what is needed to specify graph imbeddings on surfaces, and it can be used to represent and generate link structures immersed on surfaces. Since link structures immersed on surfaces can be viewed as woven images in 3D space, the extended graph rotation systems provide a well-formulated mathematical model for developing a topologically robust graphics system with strong interactive operations for the design of woven images in 3D mesh-modeling and computer-aided sculpting.
منابع مشابه
Cyclic Plain-Weaving on Polygonal Mesh Surfaces with Extended Graph Rotation Systems
In this paper, we show how to create plain-weaving over an arbitrary surface. To create a plain-weaving on a surface, we need to create cycles that cross other cycles (or themselves) by alternatingly going over and under. We prove that it is possible to create such cycles, starting from any given manifold-mesh surface, by simply twisting every edge of the manifold mesh. Our proof is based on ou...
متن کاملLink and Graph-Imbedding Models for Cyclic Weaving on Surfaces
We extend graph rotation systems into a solid mathematical model for the development of an interactive-graphics cyclic-weaving system. It involves a systematic exploration and characterization of dynamic surgery operations on graph rotation systems, such as edge-insertion, edge-deletion, and edge-twisting. This talk explains the underlying mathematics and some high-level aspects of the programm...
متن کاملOrientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs
We give a characterization of a current assignment on the bipartite Möbius ladder graph with 2n + 1 rungs. Such an assignment yields an index one current graph with current group Z12n+7 that generates an orientable face 2-colorable triangular embedding of the complete graph K12n+7 or, equivalently, an orientable biembedding of two cyclic Steiner triple systems of order 12n+7. We use our charact...
متن کاملRelating Embedding and Coloring Properties of Snarks
In 1969, Grünbaum conjectured that snarks do not have polyhedral embeddings into orientable surfaces. To describe the deviation from polyhedrality, we define the defect of a graph and use it to study embeddings of superpositions of cubic graphs into orientable surfaces. Superposition was introduced in [4] to construct snarks with arbitrary large girth. It is shown that snarks constructed in [4]...
متن کاملTriangulations of orientable surfaces by complete tripartite graphs
Orientable triangular embeddings of the complete tripartite graph Kn,n,n correspond to biembeddings of Latin squares. We show that if n is prime there are at least e ln n−n(1+o(1)) nonisomorphic biembeddings of cyclic Latin squares of order n. If n = kp, where p is a large prime number, then the number of nonisomorphic biembeddings of cyclic Latin squares of order n is at least e ln p−p(1+ln . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 193 شماره
صفحات -
تاریخ انتشار 2015