Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings
Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area.
Gespeichert in:
| Autor*in: |
Di Giacomo, Emilio [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2010 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2010 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Theory of computing systems - Springer-Verlag, 1997, 49(2010), 3 vom: 08. Juli, Seite 565-575 |
|---|---|
| Übergeordnetes Werk: |
volume:49 ; year:2010 ; number:3 ; day:08 ; month:07 ; pages:565-575 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00224-010-9275-6 |
|---|
| Katalog-ID: |
OLC2061919715 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2061919715 | ||
| 003 | DE-627 | ||
| 005 | 20230323225013.0 | ||
| 007 | tu | ||
| 008 | 200819s2010 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00224-010-9275-6 |2 doi | |
| 035 | |a (DE-627)OLC2061919715 | ||
| 035 | |a (DE-He213)s00224-010-9275-6-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 510 |q VZ |
| 082 | 0 | 4 | |a 510 |a 000 |q VZ |
| 100 | 1 | |a Di Giacomo, Emilio |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings |
| 264 | 1 | |c 2010 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC 2010 | ||
| 520 | |a Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. | ||
| 650 | 4 | |a Graph drawing | |
| 650 | 4 | |a Non-planar drawings | |
| 650 | 4 | |a RAC drawings | |
| 650 | 4 | |a LAC drawings | |
| 700 | 1 | |a Didimo, Walter |4 aut | |
| 700 | 1 | |a Liotta, Giuseppe |4 aut | |
| 700 | 1 | |a Meijer, Henk |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Theory of computing systems |d Springer-Verlag, 1997 |g 49(2010), 3 vom: 08. Juli, Seite 565-575 |w (DE-627)222610387 |w (DE-600)1355722-1 |w (DE-576)056755198 |x 1432-4350 |7 nnns |
| 773 | 1 | 8 | |g volume:49 |g year:2010 |g number:3 |g day:08 |g month:07 |g pages:565-575 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00224-010-9275-6 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-BUB | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_21 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2012 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2088 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4319 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 49 |j 2010 |e 3 |b 08 |c 07 |h 565-575 | ||
| author_variant |
g e d ge ged w d wd g l gl h m hm |
|---|---|
| matchkey_str |
article:14324350:2010----::rauvcmlxtadrsigeouinfopa |
| hierarchy_sort_str |
2010 |
| publishDate |
2010 |
| allfields |
10.1007/s00224-010-9275-6 doi (DE-627)OLC2061919715 (DE-He213)s00224-010-9275-6-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Di Giacomo, Emilio verfasserin aut Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. Graph drawing Non-planar drawings RAC drawings LAC drawings Didimo, Walter aut Liotta, Giuseppe aut Meijer, Henk aut Enthalten in Theory of computing systems Springer-Verlag, 1997 49(2010), 3 vom: 08. Juli, Seite 565-575 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:49 year:2010 number:3 day:08 month:07 pages:565-575 https://doi.org/10.1007/s00224-010-9275-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4700 AR 49 2010 3 08 07 565-575 |
| spelling |
10.1007/s00224-010-9275-6 doi (DE-627)OLC2061919715 (DE-He213)s00224-010-9275-6-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Di Giacomo, Emilio verfasserin aut Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. Graph drawing Non-planar drawings RAC drawings LAC drawings Didimo, Walter aut Liotta, Giuseppe aut Meijer, Henk aut Enthalten in Theory of computing systems Springer-Verlag, 1997 49(2010), 3 vom: 08. Juli, Seite 565-575 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:49 year:2010 number:3 day:08 month:07 pages:565-575 https://doi.org/10.1007/s00224-010-9275-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4700 AR 49 2010 3 08 07 565-575 |
| allfields_unstemmed |
10.1007/s00224-010-9275-6 doi (DE-627)OLC2061919715 (DE-He213)s00224-010-9275-6-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Di Giacomo, Emilio verfasserin aut Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. Graph drawing Non-planar drawings RAC drawings LAC drawings Didimo, Walter aut Liotta, Giuseppe aut Meijer, Henk aut Enthalten in Theory of computing systems Springer-Verlag, 1997 49(2010), 3 vom: 08. Juli, Seite 565-575 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:49 year:2010 number:3 day:08 month:07 pages:565-575 https://doi.org/10.1007/s00224-010-9275-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4700 AR 49 2010 3 08 07 565-575 |
| allfieldsGer |
10.1007/s00224-010-9275-6 doi (DE-627)OLC2061919715 (DE-He213)s00224-010-9275-6-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Di Giacomo, Emilio verfasserin aut Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. Graph drawing Non-planar drawings RAC drawings LAC drawings Didimo, Walter aut Liotta, Giuseppe aut Meijer, Henk aut Enthalten in Theory of computing systems Springer-Verlag, 1997 49(2010), 3 vom: 08. Juli, Seite 565-575 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:49 year:2010 number:3 day:08 month:07 pages:565-575 https://doi.org/10.1007/s00224-010-9275-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4700 AR 49 2010 3 08 07 565-575 |
| allfieldsSound |
10.1007/s00224-010-9275-6 doi (DE-627)OLC2061919715 (DE-He213)s00224-010-9275-6-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Di Giacomo, Emilio verfasserin aut Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2010 Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. Graph drawing Non-planar drawings RAC drawings LAC drawings Didimo, Walter aut Liotta, Giuseppe aut Meijer, Henk aut Enthalten in Theory of computing systems Springer-Verlag, 1997 49(2010), 3 vom: 08. Juli, Seite 565-575 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:49 year:2010 number:3 day:08 month:07 pages:565-575 https://doi.org/10.1007/s00224-010-9275-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4700 AR 49 2010 3 08 07 565-575 |
| language |
English |
| source |
Enthalten in Theory of computing systems 49(2010), 3 vom: 08. Juli, Seite 565-575 volume:49 year:2010 number:3 day:08 month:07 pages:565-575 |
| sourceStr |
Enthalten in Theory of computing systems 49(2010), 3 vom: 08. Juli, Seite 565-575 volume:49 year:2010 number:3 day:08 month:07 pages:565-575 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Graph drawing Non-planar drawings RAC drawings LAC drawings |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Theory of computing systems |
| authorswithroles_txt_mv |
Di Giacomo, Emilio @@aut@@ Didimo, Walter @@aut@@ Liotta, Giuseppe @@aut@@ Meijer, Henk @@aut@@ |
| publishDateDaySort_date |
2010-07-08T00:00:00Z |
| hierarchy_top_id |
222610387 |
| dewey-sort |
14 |
| id |
OLC2061919715 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2061919715</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323225013.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2010 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00224-010-9275-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2061919715</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00224-010-9275-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">000</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Di Giacomo, Emilio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph drawing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Non-planar drawings</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">RAC drawings</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">LAC drawings</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Didimo, Walter</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liotta, Giuseppe</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meijer, Henk</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theory of computing systems</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">49(2010), 3 vom: 08. Juli, Seite 565-575</subfield><subfield code="w">(DE-627)222610387</subfield><subfield code="w">(DE-600)1355722-1</subfield><subfield code="w">(DE-576)056755198</subfield><subfield code="x">1432-4350</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:49</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:3</subfield><subfield code="g">day:08</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:565-575</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00224-010-9275-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">49</subfield><subfield code="j">2010</subfield><subfield code="e">3</subfield><subfield code="b">08</subfield><subfield code="c">07</subfield><subfield code="h">565-575</subfield></datafield></record></collection>
|
| author |
Di Giacomo, Emilio |
| spellingShingle |
Di Giacomo, Emilio ddc 004 ddc 510 misc Graph drawing misc Non-planar drawings misc RAC drawings misc LAC drawings Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings |
| authorStr |
Di Giacomo, Emilio |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)222610387 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 510 - Mathematics 000 - Computer science, information & general works |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1432-4350 |
| topic_title |
004 510 VZ 510 000 VZ Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings Graph drawing Non-planar drawings RAC drawings LAC drawings |
| topic |
ddc 004 ddc 510 misc Graph drawing misc Non-planar drawings misc RAC drawings misc LAC drawings |
| topic_unstemmed |
ddc 004 ddc 510 misc Graph drawing misc Non-planar drawings misc RAC drawings misc LAC drawings |
| topic_browse |
ddc 004 ddc 510 misc Graph drawing misc Non-planar drawings misc RAC drawings misc LAC drawings |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Theory of computing systems |
| hierarchy_parent_id |
222610387 |
| dewey-tens |
000 - Computer science, knowledge & systems 510 - Mathematics |
| hierarchy_top_title |
Theory of computing systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 |
| title |
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings |
| ctrlnum |
(DE-627)OLC2061919715 (DE-He213)s00224-010-9275-6-p |
| title_full |
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings |
| author_sort |
Di Giacomo, Emilio |
| journal |
Theory of computing systems |
| journalStr |
Theory of computing systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 500 - Science |
| recordtype |
marc |
| publishDateSort |
2010 |
| contenttype_str_mv |
txt |
| container_start_page |
565 |
| author_browse |
Di Giacomo, Emilio Didimo, Walter Liotta, Giuseppe Meijer, Henk |
| container_volume |
49 |
| class |
004 510 VZ 510 000 VZ |
| format_se |
Aufsätze |
| author-letter |
Di Giacomo, Emilio |
| doi_str_mv |
10.1007/s00224-010-9275-6 |
| dewey-full |
004 510 000 |
| title_sort |
area, curve complexity, and crossing resolution of non-planar graph drawings |
| title_auth |
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings |
| abstract |
Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. © Springer Science+Business Media, LLC 2010 |
| abstractGer |
Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. © Springer Science+Business Media, LLC 2010 |
| abstract_unstemmed |
Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area. © Springer Science+Business Media, LLC 2010 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4700 |
| container_issue |
3 |
| title_short |
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings |
| url |
https://doi.org/10.1007/s00224-010-9275-6 |
| remote_bool |
false |
| author2 |
Didimo, Walter Liotta, Giuseppe Meijer, Henk |
| author2Str |
Didimo, Walter Liotta, Giuseppe Meijer, Henk |
| ppnlink |
222610387 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00224-010-9275-6 |
| up_date |
2024-07-04T04:46:20.322Z |
| _version_ |
1803622421957181440 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2061919715</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323225013.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2010 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00224-010-9275-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2061919715</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00224-010-9275-6-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">000</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Di Giacomo, Emilio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper we study non-planar drawings of graphs, and study trade-offs between the crossing resolution (i.e., the minimum angle formed by two crossing segments), the curve complexity (i.e., maximum number of bends per edge), the total number of bends, and the area.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph drawing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Non-planar drawings</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">RAC drawings</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">LAC drawings</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Didimo, Walter</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liotta, Giuseppe</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Meijer, Henk</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theory of computing systems</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">49(2010), 3 vom: 08. Juli, Seite 565-575</subfield><subfield code="w">(DE-627)222610387</subfield><subfield code="w">(DE-600)1355722-1</subfield><subfield code="w">(DE-576)056755198</subfield><subfield code="x">1432-4350</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:49</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:3</subfield><subfield code="g">day:08</subfield><subfield code="g">month:07</subfield><subfield code="g">pages:565-575</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00224-010-9275-6</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">49</subfield><subfield code="j">2010</subfield><subfield code="e">3</subfield><subfield code="b">08</subfield><subfield code="c">07</subfield><subfield code="h">565-575</subfield></datafield></record></collection>
|
| score |
7.399522 |