Finding the Visibility Representation of Plane Graph by DFS
碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === Let G be an n-node planar graph. In a visibility representation of G, each node of G is represented by a horizontal segment such that the segments representing any two adjacent nodes of G are vertically visible to each other. In this thesis, we design a heurist...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/40173564112773354108 |