| IEICE Technical Committee Submission System Conference Paper's Information |
Online Proceedings [Sign in] Tech. Rep. Archives |
| Go Top Page | Go Previous | [Japanese] / [English] |
| Paper Abstract and Keywords | ||
| Presentation | 2013-04-24 16:10 An Algorithm for Finding an Orthogonal Drawing of a Hierarchical Graph Tetsuya Araki, Sumio Masuda, Ikunori Matoba, Kazuaki Yamaguchi, Toshiki Saitoh (Kobe Univ.)  COMP2013-7 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | In this article, we show an algorithm for finding an orthogonal drawing of a hierarchical graph. In an orthogonal drawing, each edge is drawn as a path consisting of vertical and horizontal line segments. We present a method for determining the x-coordinates of the vertices so that the total sum of the lengths of horizontal line segments becomes small. We also propose a method for drawing hyperedges. It uses at most two horizontal line segments to draw each hyperedge and can make both the number of edge crossings in the graph drawing and that of y-coordinates of the horizontal line segments small. | |
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | hierarchical graph / orthogonal drawing / heuristic algorithm / hyperedge / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 113, no. 14, COMP2013-7, pp. 35-42, April 2013. | |
| Paper # | COMP2013-7 | |
| Date of Issue | 2013-04-17 (COMP) | |
| ISSN | Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 | |
| Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) | |
| Download PDF | COMP2013-7 |
|
| Conference Information | |
| Committee | COMP |
| Conference Date | 2013-04-24 - 2013-04-24 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kobe University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | COMP |
| Conference Code | 2013-04-COMP |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An Algorithm for Finding an Orthogonal Drawing of a Hierarchical Graph |
| Sub Title (in English) | |
| Keyword(1) | hierarchical graph |
| Keyword(2) | orthogonal drawing |
| Keyword(3) | heuristic algorithm |
| Keyword(4) | hyperedge |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Tetsuya Araki |
| 1st Author's Affiliation | Kobe University (Kobe Univ.) |
| 2nd Author's Name | Sumio Masuda |
| 2nd Author's Affiliation | Kobe University (Kobe Univ.) |
| 3rd Author's Name | Ikunori Matoba |
| 3rd Author's Affiliation | Kobe University (Kobe Univ.) |
| 4th Author's Name | Kazuaki Yamaguchi |
| 4th Author's Affiliation | Kobe University (Kobe Univ.) |
| 5th Author's Name | Toshiki Saitoh |
| 5th Author's Affiliation | Kobe University (Kobe Univ.) |
| 6th Author's Name | |
| 6th Author's Affiliation | () |
| 7th Author's Name | |
| 7th Author's Affiliation | () |
| 8th Author's Name | |
| 8th Author's Affiliation | () |
| 9th Author's Name | |
| 9th Author's Affiliation | () |
| 10th Author's Name | |
| 10th Author's Affiliation | () |
| 11th Author's Name | |
| 11th Author's Affiliation | () |
| 12th Author's Name | |
| 12th Author's Affiliation | () |
| 13th Author's Name | |
| 13th Author's Affiliation | () |
| 14th Author's Name | |
| 14th Author's Affiliation | () |
| 15th Author's Name | |
| 15th Author's Affiliation | () |
| 16th Author's Name | |
| 16th Author's Affiliation | () |
| 17th Author's Name | |
| 17th Author's Affiliation | () |
| 18th Author's Name | |
| 18th Author's Affiliation | () |
| Speaker | Author-1 |
| Date Time | 2013-04-24 16:10:00 |
| Presentation Time | 35 minutes |
| Registration for | COMP |
| Paper # | COMP2013-7 |
| Volume (vol) | vol.113 |
| Number (no) | no.14 |
| Page | pp.35-42 |
| #Pages | 8 |
| Date of Issue | 2013-04-17 (COMP) |
[Return to Top Page]