Edge Routing with Minimum Edge Crossings
碩士 === 國立臺灣大學 === 電機工程學研究所 === 100 === A solution to the problem of graph drawing can be considered to have two components, which are the positions of vertices and the routes of edges. These two components are not independent, and both need to be considered in order to produce a drawing that is mor...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/97756970198832428610 |