#TITLE_ALTERNATIVE#

Network flow technique can be used to solve variety problems in graph drawing, especially for planar graph drawing. Minimization of the number of bends has been an important problem because it is one of the aesthetics of graph drawing in order to achieve readability of orthogonal graphs. In this fin...

Full description

Saved in:
Bibliographic Details
Main Author: SHERLIN (NIM 10104057), INTAN
Format: Final Project
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/10675
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:10675
spelling id-itb.:106752017-09-27T11:43:04Z#TITLE_ALTERNATIVE# SHERLIN (NIM 10104057), INTAN Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/10675 Network flow technique can be used to solve variety problems in graph drawing, especially for planar graph drawing. Minimization of the number of bends has been an important problem because it is one of the aesthetics of graph drawing in order to achieve readability of orthogonal graphs. In this final project, a graph drawing method based on network flow technique is presented. The network flow technique is used in this purpose since minimizing bends in planar orthogonal drawing can be modeled as a minimum cost flow problem on a flow network derived from an embedded planar graph. Given planar graph of degree less than/equal 4, we want to find a planar orthogonal drawing of G with the minimum number of bends. The algorithm of orthogonal graph drawing that minimizes the number of bends is given to see how the network flow model works for some embedded planar graph. There also a validation in the form of comparison between the program using this algorithm and another technique to determine its accuracy and effectiveness. text
institution Institut Teknologi Bandung
building Institut Teknologi Bandung Library
continent Asia
country Indonesia
Indonesia
content_provider Institut Teknologi Bandung
collection Digital ITB
language Indonesia
description Network flow technique can be used to solve variety problems in graph drawing, especially for planar graph drawing. Minimization of the number of bends has been an important problem because it is one of the aesthetics of graph drawing in order to achieve readability of orthogonal graphs. In this final project, a graph drawing method based on network flow technique is presented. The network flow technique is used in this purpose since minimizing bends in planar orthogonal drawing can be modeled as a minimum cost flow problem on a flow network derived from an embedded planar graph. Given planar graph of degree less than/equal 4, we want to find a planar orthogonal drawing of G with the minimum number of bends. The algorithm of orthogonal graph drawing that minimizes the number of bends is given to see how the network flow model works for some embedded planar graph. There also a validation in the form of comparison between the program using this algorithm and another technique to determine its accuracy and effectiveness.
format Final Project
author SHERLIN (NIM 10104057), INTAN
spellingShingle SHERLIN (NIM 10104057), INTAN
#TITLE_ALTERNATIVE#
author_facet SHERLIN (NIM 10104057), INTAN
author_sort SHERLIN (NIM 10104057), INTAN
title #TITLE_ALTERNATIVE#
title_short #TITLE_ALTERNATIVE#
title_full #TITLE_ALTERNATIVE#
title_fullStr #TITLE_ALTERNATIVE#
title_full_unstemmed #TITLE_ALTERNATIVE#
title_sort #title_alternative#
url https://digilib.itb.ac.id/gdl/view/10675
_version_ 1820665928945238016