Hexadecimal Grid Graph Representation of Multilayer Rectangular Dissections
نویسندگان
چکیده
Multilayer rectangular dissections have been considered such as models of multi page books in spreadsheets, 3D floor plans and stratum maps in terrain surfaces. In this paper, we deal with a representation of the multilayer rectangular dissections that are effective for ruled line oriented operations and introduce hexadecimal grids corresponding to multilayer rectangular dissections. And we show an cell unification algorithm that runs in O(1) time, and also show a layer deletion algorithm. Furthermore, we also propose a processing system.
منابع مشابه
Rectangle and Square Representations of Planar Graphs
In the first part of this survey we consider planar graphs that can be represented by a dissections of a rectangle into rectangles. In rectangular drawings the corners of the rectangles represent the vertices. The graph obtained by taking the rectangles as vertices and contacts as edges is the rectangular dual. In visibility graphs and segment contact graphs the vertices correspond to horizonta...
متن کاملStudy of Proper Hierarchical Graphs on a Grid
Hierarchical planar graph embedding (sometimes called level planar graphs) is widely recognized as a very important task in diverse fields of research and development. Given a proper hierarchical planar graph, we want to find a geometric position of every vertex (layout) in a straight-line grid drawing without any edge-intersection. An additional objective is to minimize the area of the rectang...
متن کامل1-String CZ-Representation of Planar Graphs
In this paper, we prove that every planar 4-connected graph has a CZ-representation—a string representation using paths in a rectangular grid that contain at most one vertical segment. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. The required size of the grid is n× 2n.
متن کامل1-String B_2-VPG Representation of Planar Graphs
In this paper, we prove that every planar graph has a 1-string B2-VPG representation—a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices u, v intersect precisely once whenever there is an edge between u and v. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling
متن کاملTouching Triangle Representations for 3-Connected Planar Graphs
A touching triangle graph (TTG) representation of a planar graph is a planar drawing Γ of the graph, where each vertex is represented as a triangle and each edge e is represented as a side contact of the triangles that correspond to the end vertices of e. We call Γ a proper TTG representation if Γ determines a tiling of a triangle, where each tile corresponds to a distinct vertex of the input g...
متن کامل