Hexagonal grid drawings View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1993

AUTHORS

Goos Kant

ABSTRACT

In this paper we present a linear algorithm to draw triconnected planar graphs of degree 3 planar on a linear-sized hexagonal grid such that in at most one edge are bends. This algorithm can be used to draw this class of graphs planar with straight lines on a n/2 × n/2 grid, improving the best known grid bounds by a factor 4. We also show how to draw planar graphs of degree at most 3 planar with straight lines such that the minimum angle is ≥ π/6, thereby answering a question of Formann et al. More... »

PAGES

263-276

References to SciGraph publications

Book

TITLE

Graph-Theoretic Concepts in Computer Science

ISBN

978-3-540-56402-7
978-3-540-47554-5

Author Affiliations

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-56402-0_53

DOI

http://dx.doi.org/10.1007/3-540-56402-0_53

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1043848821


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0101", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Pure Mathematics", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Mathematical Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Utrecht University", 
          "id": "https://www.grid.ac/institutes/grid.5477.1", 
          "name": [
            "Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508\u00a0TB Utrecht, The Netherlands"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kant", 
        "givenName": "Goos", 
        "id": "sg:person.013743554756.94", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013743554756.94"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/3-540-55706-7_22", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1035145715", 
          "https://doi.org/10.1007/3-540-55706-7_22"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0020-0190(91)90059-q", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1052090013"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/21.87055", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061122416"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1137/0216030", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1062841976"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/fscs.1990.89527", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1086341203"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1993", 
    "datePublishedReg": "1993-01-01", 
    "description": "In this paper we present a linear algorithm to draw triconnected planar graphs of degree 3 planar on a linear-sized hexagonal grid such that in at most one edge are bends. This algorithm can be used to draw this class of graphs planar with straight lines on a n/2 \u00d7 n/2 grid, improving the best known grid bounds by a factor 4. We also show how to draw planar graphs of degree at most 3 planar with straight lines such that the minimum angle is \u2265 \u03c0/6, thereby answering a question of Formann et al.", 
    "editor": [
      {
        "familyName": "Mayr", 
        "givenName": "Ernst W.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-56402-0_53", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-56402-7", 
        "978-3-540-47554-5"
      ], 
      "name": "Graph-Theoretic Concepts in Computer Science", 
      "type": "Book"
    }, 
    "name": "Hexagonal grid drawings", 
    "pagination": "263-276", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-56402-0_53"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "d0de842cbcca00e665166fbbb2579e7d9a1368b8832eff742ed90725a93d00f5"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1043848821"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-56402-0_53", 
      "https://app.dimensions.ai/details/publication/pub.1043848821"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T16:06", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8675_00000075.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/3-540-56402-0_53"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-56402-0_53'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-56402-0_53'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-56402-0_53'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-56402-0_53'


 

This table displays all metadata directly associated to this object as RDF triples.

81 TRIPLES      23 PREDICATES      32 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-56402-0_53 schema:about anzsrc-for:01
2 anzsrc-for:0101
3 schema:author Nff582c3306354edfb4b53633a06bde15
4 schema:citation sg:pub.10.1007/3-540-55706-7_22
5 https://doi.org/10.1016/0020-0190(91)90059-q
6 https://doi.org/10.1109/21.87055
7 https://doi.org/10.1109/fscs.1990.89527
8 https://doi.org/10.1137/0216030
9 schema:datePublished 1993
10 schema:datePublishedReg 1993-01-01
11 schema:description In this paper we present a linear algorithm to draw triconnected planar graphs of degree 3 planar on a linear-sized hexagonal grid such that in at most one edge are bends. This algorithm can be used to draw this class of graphs planar with straight lines on a n/2 × n/2 grid, improving the best known grid bounds by a factor 4. We also show how to draw planar graphs of degree at most 3 planar with straight lines such that the minimum angle is ≥ π/6, thereby answering a question of Formann et al.
12 schema:editor N9861e1bc90a144bdb5d360eebc7fad04
13 schema:genre chapter
14 schema:inLanguage en
15 schema:isAccessibleForFree true
16 schema:isPartOf Nab9a1c7e422a48afbeb7d8809cc57890
17 schema:name Hexagonal grid drawings
18 schema:pagination 263-276
19 schema:productId N3c7012bd8aa748f881cbfa0c669f5c9c
20 N5277ef4eadee44749613119b40d7cabc
21 N7ac32663ef024cbbb438cfb21142dda6
22 schema:publisher N4e9ff2992a354e3b99f40d4a67bf100b
23 schema:sameAs https://app.dimensions.ai/details/publication/pub.1043848821
24 https://doi.org/10.1007/3-540-56402-0_53
25 schema:sdDatePublished 2019-04-15T16:06
26 schema:sdLicense https://scigraph.springernature.com/explorer/license/
27 schema:sdPublisher Nf53aaa526032494cbe81428910fc7676
28 schema:url http://link.springer.com/10.1007/3-540-56402-0_53
29 sgo:license sg:explorer/license/
30 sgo:sdDataset chapters
31 rdf:type schema:Chapter
32 N3c7012bd8aa748f881cbfa0c669f5c9c schema:name readcube_id
33 schema:value d0de842cbcca00e665166fbbb2579e7d9a1368b8832eff742ed90725a93d00f5
34 rdf:type schema:PropertyValue
35 N4e9ff2992a354e3b99f40d4a67bf100b schema:location Berlin, Heidelberg
36 schema:name Springer Berlin Heidelberg
37 rdf:type schema:Organisation
38 N5277ef4eadee44749613119b40d7cabc schema:name dimensions_id
39 schema:value pub.1043848821
40 rdf:type schema:PropertyValue
41 N7ac32663ef024cbbb438cfb21142dda6 schema:name doi
42 schema:value 10.1007/3-540-56402-0_53
43 rdf:type schema:PropertyValue
44 N9861e1bc90a144bdb5d360eebc7fad04 rdf:first Nc4999f8957484b43b5f266f7c1173242
45 rdf:rest rdf:nil
46 Nab9a1c7e422a48afbeb7d8809cc57890 schema:isbn 978-3-540-47554-5
47 978-3-540-56402-7
48 schema:name Graph-Theoretic Concepts in Computer Science
49 rdf:type schema:Book
50 Nc4999f8957484b43b5f266f7c1173242 schema:familyName Mayr
51 schema:givenName Ernst W.
52 rdf:type schema:Person
53 Nf53aaa526032494cbe81428910fc7676 schema:name Springer Nature - SN SciGraph project
54 rdf:type schema:Organization
55 Nff582c3306354edfb4b53633a06bde15 rdf:first sg:person.013743554756.94
56 rdf:rest rdf:nil
57 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
58 schema:name Mathematical Sciences
59 rdf:type schema:DefinedTerm
60 anzsrc-for:0101 schema:inDefinedTermSet anzsrc-for:
61 schema:name Pure Mathematics
62 rdf:type schema:DefinedTerm
63 sg:person.013743554756.94 schema:affiliation https://www.grid.ac/institutes/grid.5477.1
64 schema:familyName Kant
65 schema:givenName Goos
66 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013743554756.94
67 rdf:type schema:Person
68 sg:pub.10.1007/3-540-55706-7_22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1035145715
69 https://doi.org/10.1007/3-540-55706-7_22
70 rdf:type schema:CreativeWork
71 https://doi.org/10.1016/0020-0190(91)90059-q schema:sameAs https://app.dimensions.ai/details/publication/pub.1052090013
72 rdf:type schema:CreativeWork
73 https://doi.org/10.1109/21.87055 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061122416
74 rdf:type schema:CreativeWork
75 https://doi.org/10.1109/fscs.1990.89527 schema:sameAs https://app.dimensions.ai/details/publication/pub.1086341203
76 rdf:type schema:CreativeWork
77 https://doi.org/10.1137/0216030 schema:sameAs https://app.dimensions.ai/details/publication/pub.1062841976
78 rdf:type schema:CreativeWork
79 https://www.grid.ac/institutes/grid.5477.1 schema:alternateName Utrecht University
80 schema:name Dept. of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands
81 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...