✦ LIBER ✦

On-line Planar Graph Embedding

✍ Scribed by Roberto Tamassia

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 504 KB
Volume: 21
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1996.0044

No coin nor oath required. For personal study only.

✦ Synopsis

We present a dynamic data structure for the incremental construction of a planar embedding of a planar graph. The data structure supports the following Ž . operations: i testing if a new edge can be added to the embedding without Ž . introducing crossing; and ii adding vertices and edges. The time complexity of Ž . Ž . each operation is O log n amortized for edge insertion , and the memory space Ž . and preprocessing time are O n , where n is the current number of vertices of the graph.

📜 SIMILAR VOLUMES

On convex embeddings of planar 3-connect

On convex embeddings of planar 3-connected graphs

✍ Kelmans, Alexander 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 2 views

A well-known Tutte's theorem claims that every 3-connected planar graph has a convex embedding into the plane. Tutte's arguments also show that, moreover, for every nonseparating cycle C of a 3-connected graph G, there exists a convex embedding of G such that C is a boundary of the outer face in thi

On the Number of Acute Triangles in a St

On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph

✍ Atsushi Kaneko; Hiroshi Maehara; Mamoru Watanabe 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 80 KB

In this paper we show that any maximal planar graph with m triangles except the unbounded face can be transformed into a straight-line embedding in which at least WmÂ3X triangles are acute triangles. Moreover, we show that any maximal outerplanar graph can be transformed into a straight-line embeddi

Straight line embeddings of cubic planar

Straight line embeddings of cubic planar graphs with integer edge lengths

✍ Jim Geelen; Anjie Guo; David McKinnon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008

On a straight-line embedding problem of

On a straight-line embedding problem of graphs

✍ Shin-ichi Tokunaga 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Let G be a planar graph with n vertices, v be a specified vertex of G, and P be a set of n points in the Euclidian plane ~2 in general position. A straight-line embeddin9 of G onto P is an embedding of G onto R 2 whose images of vertices are distinct points in P and whose images of edges are (straig

Enumeration of projective-planar embeddi

Enumeration of projective-planar embeddings of graphs

✍ Seiya Negami 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 562 KB

It will be shown that the number of equivalence classes of embeddings of a 3-connected nonplanar graph into a projective plane coincides with the number of isomorphism classes of planar double coverings of the graph and a combinatorial method to determine the number will be developed.

Embedding Meshes on the Star Graph

✍ S. Ranka; J.C. Wang; N. Yeh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 362 KB

We develop algorithms for mapping \(n\)-dimensional meshes on a star graph of degree \(n\) with expansion 1 and dilation 3 . We show that an \(n\)-degree star graph can efficiently simulate an \(n\)-dimensional mesh. 1993 Academic Press, Inc.