Planar graph drawing

• 作者: Nishizeki, T.
• 其他作者: Rahman, Md. Saidur,
• 出版: Singapore ;Hackensack, NJ : World Scientific ©2004.
• 稽核項: 1 online resource (xiii, 295 pages) :illustrations.
• 叢書名: Lecture notes series on computing ;v. 12
• 標題: MATHEMATICS , Graphic Methods. , MATHEMATICS Graphic Methods. , Graph theory. , Electronic books.
• ISBN: 9812560335 , 9789812560339
• 試查全文@TNUA:
  
• 附註: Includes bibliographical references (pages 281-290) and index. Intro; Planar Graph Drawing; Contents; Preface; Motivation; Organization of the Book; Use of the Book; Acknowledgments; 1. Graph Drawing; 1.1 Introduction; 1.2 Historical Background; 1.3 Drawing Styles; 1.3.1 Planar Drawing; 1.3.2 Polyline Drawing; 1.3.3 Straight Line Drawing; 1.3.4 Convex Drawing; 1.3.5 Orthogonal Drawing; 1.3.6 Box-Orthogonal Drawing; 1.3.7 Rectangular Drawing; 1.3.8 Box-Rectangular Drawing; 1.3.9 Grid Drawing; 1.3.10 Visibility Drawing; 1.4 Properties of Drawings; 1.5 Applications of Graph Drawing; 1.5.1 Floorplanning; 1.5.2 VLSI Layout; 1.5.3 Software Engineering 1.5.4 Simulating Molecular Structures1.6 Scope of This Book; Exercise; 2. Graph Theoretic Foundations; 2.1 Basic Terminology; 2.1.1 Graphs and Multigraphs; 2.1.2 Subgraphs; 2.1.3 Paths and Cycles; 2.1.4 Chains; 2.1.5 Connectivity; 2.1.6 Trees and Forests; 2.1.7 Complete Graphs; 2.1.8 Bipartite Graphs; 2.1.9 Subdivisions; 2.2 Planar Graphs; 2.2.1 Plane Graphs; 2.2.2 Euler's Formula; 2.2.3 Dual Graph; 2.3 Bibliographic Notes; Exercise; 3. Algorithmic Foundations; 3.1 What is an Algorithm?; 3.2 Machine Model and Complexity; 3.2.1 The O( ) notation; 3.2.2 Polynomial Algorithms 3.2.3 NP-Complete Problems3.3 Data Structures and Graph Representation; 3.4 Exploring a Graph; 3.4.1 Depth-First Search; 3.4.2 Breadth-First Search; 3.5 Data Structures for Plane Graphs; 3.6 Bibliographic Notes; Exercise; 4. Straight Line Drawing; 4.1 Introduction; 4.2 Shift Method; 4.2.1 Canonical Ordering; 4.2.2 Shift Algorithm; 4.2.3 Linear-Time Implementation; 4.3 Realizer Method; 4.3.1 Barycentric Representation; 4.3.2 Schnyder Labeling; 4.3.3 Realizer; 4.3.4 Drawing Algorithm with Realizer; 4.4 Compact Grid Drawing; 4.4.1 Four-Canonical Ordering; 4.4.2 Algorithm Four-Connected-Draw 4.4.3 Drawing G'4.5 Bibliographic Notes; Exercise; 5. Convex Drawing; 5.1 Introduction; 5.2 Convex Drawing; 5.3 Convex Testing; 5.3.1 Definitions; 5.3.2 Condition II; 5.3.3 Testing Algorithm; 5.4 Convex Grid Drawings of 3-Connected Plane Graphs; 5.4.1 Canonical Decomposition; 5.4.2 Algorithm for Convex Grid Drawing; 5.5 Convex Grid Drawings of 4-Connected Plane Graphs; 5.5.1 Four-Canonical Decomposition; 5.5.2 Algorithm; 5.5.2.1 How to Compute x-Coordinates; 5.5.2.2 How to Compute y-Coordinates; 5.6 Bibliographic Notes; Exercises; 6. Rectangular Drawing; 6.1 Introduction 6.2 Rectangular Drawing and Matching6.3 Linear Algorithm for Rectangular Drawings of Plane Graphs; 6.3.1 Thomassen's Theorem; 6.3.2 Sufficiency; 6.3.3 Rectangular Drawing Algorithm; 6.3.4 Rectangular Grid Drawing; 6.4 Rectangular Drawings without Designated Corners; 6.5 Rectangular Drawings of Planar Graphs; 6.5.1 Case for a Subdivision of a Planar 3-connected Cubic Graph; 6.5.2 The Other Case; 6.6 Bibliographic Notes; Exercise; 7. Box-Rectangular Drawing; 7.1 Introduction; 7.2 Preliminaries; 7.3 Box-Rectangular Drawings with Designated Corner Boxes
• 電子資源: https://dbs.tnua.edu.tw/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=127456
• 系統號: 005316025
• 資料類型: 電子書
• 讀者標籤: 需登入
• 引用網址: 複製連結
• 目前引用數