The Circle-Brush Algorithm View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1988

AUTHORS

K. C. Posch , W. D. Fellner

ABSTRACT

“Brushing” commonly means the drawing of curves with various linewidths in bit-mapped graphics. For practical reasons it is best done with circles of suitable diameter. In this way we obtain constant linewidth independent of the curve’s slope. Considering all possible integer diameters corresponding to integer linewidths every second width has an odd value. The underlying circle algorithm thus must be able to handle both integer and half-integer radii. The circle-brush algorithm handles both situations and produces “best approximations”: all grid points produced simultaneously minimize (1) the residual, (2) the Buclidean distance to the circle, and (3) the displacement along the grid line from the intersection with the circle. The circle-brush algorithm was developed in close relation to its concrete implementation in a VLSI-structure. More... »

PAGES

857-878

Book

TITLE

Theoretical Foundations of Computer Graphics and CAD

ISBN

978-3-642-83541-4
978-3-642-83539-1

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-642-83539-1_35

DOI

http://dx.doi.org/10.1007/978-3-642-83539-1_35

DIMENSIONS

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


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/0103", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Numerical and Computational 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": {
          "name": [
            "Institutes for Information Processing, Technical University of Graz and Austrian Computer Society, Schiesztattgasse 4a, A-8010\u00a0Graz, Austria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Posch", 
        "givenName": "K. C.", 
        "id": "sg:person.013270133353.59", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013270133353.59"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "name": [
            "Institutes for Information Processing, Technical University of Graz and Austrian Computer Society, Schiesztattgasse 4a, A-8010\u00a0Graz, Austria"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fellner", 
        "givenName": "W. D.", 
        "id": "sg:person.012622577711.32", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012622577711.32"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1145/359423.359432", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1001254099"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0146-664x(76)90036-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1015075988"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/282918.282943", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1020090289"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1093/comjnl/10.3.282", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1027582978"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0146-664x(79)90036-4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1029913921"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/245.246", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1030670208"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1145/245.248", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1041471884"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0146-664x(74)90028-8", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1046586042"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1049/ip-i-1.1981.0010", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1056854946"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1109/tc.1979.1675240", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1061532177"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1147/sj.41.0025", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1063184673"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "1988", 
    "datePublishedReg": "1988-01-01", 
    "description": "\u201cBrushing\u201d commonly means the drawing of curves with various linewidths in bit-mapped graphics. For practical reasons it is best done with circles of suitable diameter. In this way we obtain constant linewidth independent of the curve\u2019s slope. Considering all possible integer diameters corresponding to integer linewidths every second width has an odd value. The underlying circle algorithm thus must be able to handle both integer and half-integer radii. The circle-brush algorithm handles both situations and produces \u201cbest approximations\u201d: all grid points produced simultaneously minimize (1) the residual, (2) the Buclidean distance to the circle, and (3) the displacement along the grid line from the intersection with the circle. The circle-brush algorithm was developed in close relation to its concrete implementation in a VLSI-structure.", 
    "editor": [
      {
        "familyName": "Earnshaw", 
        "givenName": "Rae A.", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-642-83539-1_35", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-642-83541-4", 
        "978-3-642-83539-1"
      ], 
      "name": "Theoretical Foundations of Computer Graphics and CAD", 
      "type": "Book"
    }, 
    "name": "The Circle-Brush Algorithm", 
    "pagination": "857-878", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-642-83539-1_35"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "0e9ee71744d4f005f2d21460904e79c0b25b10ff01779117ffee0f8bbf4be815"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1003069270"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-642-83539-1_35", 
      "https://app.dimensions.ai/details/publication/pub.1003069270"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T21:55", 
    "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_8693_00000244.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/978-3-642-83539-1_35"
  }
]
 

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/978-3-642-83539-1_35'

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/978-3-642-83539-1_35'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-83539-1_35'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-642-83539-1_35'


 

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

106 TRIPLES      23 PREDICATES      38 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-642-83539-1_35 schema:about anzsrc-for:01
2 anzsrc-for:0103
3 schema:author N12469f4362d046cd80639a7b2558cbe1
4 schema:citation https://doi.org/10.1016/0146-664x(74)90028-8
5 https://doi.org/10.1016/0146-664x(76)90036-8
6 https://doi.org/10.1016/0146-664x(79)90036-4
7 https://doi.org/10.1049/ip-i-1.1981.0010
8 https://doi.org/10.1093/comjnl/10.3.282
9 https://doi.org/10.1109/tc.1979.1675240
10 https://doi.org/10.1145/245.246
11 https://doi.org/10.1145/245.248
12 https://doi.org/10.1145/282918.282943
13 https://doi.org/10.1145/359423.359432
14 https://doi.org/10.1147/sj.41.0025
15 schema:datePublished 1988
16 schema:datePublishedReg 1988-01-01
17 schema:description “Brushing” commonly means the drawing of curves with various linewidths in bit-mapped graphics. For practical reasons it is best done with circles of suitable diameter. In this way we obtain constant linewidth independent of the curve’s slope. Considering all possible integer diameters corresponding to integer linewidths every second width has an odd value. The underlying circle algorithm thus must be able to handle both integer and half-integer radii. The circle-brush algorithm handles both situations and produces “best approximations”: all grid points produced simultaneously minimize (1) the residual, (2) the Buclidean distance to the circle, and (3) the displacement along the grid line from the intersection with the circle. The circle-brush algorithm was developed in close relation to its concrete implementation in a VLSI-structure.
18 schema:editor N5b8d1b3276984860b10801f76c9b38f4
19 schema:genre chapter
20 schema:inLanguage en
21 schema:isAccessibleForFree false
22 schema:isPartOf N5cf2d550ed804279b6c1f134a319be19
23 schema:name The Circle-Brush Algorithm
24 schema:pagination 857-878
25 schema:productId N6c3d36c8657941a88ff580c8338a3c2f
26 N820ed3fe50014a3fb182a65e3dbdf220
27 Nddf5e0b783964839b7cf372ccfd43f1d
28 schema:publisher Nf4daa634b06c46c283ce3223a2756041
29 schema:sameAs https://app.dimensions.ai/details/publication/pub.1003069270
30 https://doi.org/10.1007/978-3-642-83539-1_35
31 schema:sdDatePublished 2019-04-15T21:55
32 schema:sdLicense https://scigraph.springernature.com/explorer/license/
33 schema:sdPublisher N016e59a1cdbd408fab9d138fc552e122
34 schema:url http://link.springer.com/10.1007/978-3-642-83539-1_35
35 sgo:license sg:explorer/license/
36 sgo:sdDataset chapters
37 rdf:type schema:Chapter
38 N016e59a1cdbd408fab9d138fc552e122 schema:name Springer Nature - SN SciGraph project
39 rdf:type schema:Organization
40 N12469f4362d046cd80639a7b2558cbe1 rdf:first sg:person.013270133353.59
41 rdf:rest N7f4881ba8be9446c9ce72c9e86557112
42 N3decfedf6b3d4a35a9002e58ffc6c1da schema:name Institutes for Information Processing, Technical University of Graz and Austrian Computer Society, Schiesztattgasse 4a, A-8010 Graz, Austria
43 rdf:type schema:Organization
44 N4d54de38876543f78ac0abfe3460c7ed schema:name Institutes for Information Processing, Technical University of Graz and Austrian Computer Society, Schiesztattgasse 4a, A-8010 Graz, Austria
45 rdf:type schema:Organization
46 N5b8d1b3276984860b10801f76c9b38f4 rdf:first N765badae61e045ab8f67ac3225ca0c8f
47 rdf:rest rdf:nil
48 N5cf2d550ed804279b6c1f134a319be19 schema:isbn 978-3-642-83539-1
49 978-3-642-83541-4
50 schema:name Theoretical Foundations of Computer Graphics and CAD
51 rdf:type schema:Book
52 N6c3d36c8657941a88ff580c8338a3c2f schema:name dimensions_id
53 schema:value pub.1003069270
54 rdf:type schema:PropertyValue
55 N765badae61e045ab8f67ac3225ca0c8f schema:familyName Earnshaw
56 schema:givenName Rae A.
57 rdf:type schema:Person
58 N7f4881ba8be9446c9ce72c9e86557112 rdf:first sg:person.012622577711.32
59 rdf:rest rdf:nil
60 N820ed3fe50014a3fb182a65e3dbdf220 schema:name readcube_id
61 schema:value 0e9ee71744d4f005f2d21460904e79c0b25b10ff01779117ffee0f8bbf4be815
62 rdf:type schema:PropertyValue
63 Nddf5e0b783964839b7cf372ccfd43f1d schema:name doi
64 schema:value 10.1007/978-3-642-83539-1_35
65 rdf:type schema:PropertyValue
66 Nf4daa634b06c46c283ce3223a2756041 schema:location Berlin, Heidelberg
67 schema:name Springer Berlin Heidelberg
68 rdf:type schema:Organisation
69 anzsrc-for:01 schema:inDefinedTermSet anzsrc-for:
70 schema:name Mathematical Sciences
71 rdf:type schema:DefinedTerm
72 anzsrc-for:0103 schema:inDefinedTermSet anzsrc-for:
73 schema:name Numerical and Computational Mathematics
74 rdf:type schema:DefinedTerm
75 sg:person.012622577711.32 schema:affiliation N4d54de38876543f78ac0abfe3460c7ed
76 schema:familyName Fellner
77 schema:givenName W. D.
78 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012622577711.32
79 rdf:type schema:Person
80 sg:person.013270133353.59 schema:affiliation N3decfedf6b3d4a35a9002e58ffc6c1da
81 schema:familyName Posch
82 schema:givenName K. C.
83 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013270133353.59
84 rdf:type schema:Person
85 https://doi.org/10.1016/0146-664x(74)90028-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1046586042
86 rdf:type schema:CreativeWork
87 https://doi.org/10.1016/0146-664x(76)90036-8 schema:sameAs https://app.dimensions.ai/details/publication/pub.1015075988
88 rdf:type schema:CreativeWork
89 https://doi.org/10.1016/0146-664x(79)90036-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029913921
90 rdf:type schema:CreativeWork
91 https://doi.org/10.1049/ip-i-1.1981.0010 schema:sameAs https://app.dimensions.ai/details/publication/pub.1056854946
92 rdf:type schema:CreativeWork
93 https://doi.org/10.1093/comjnl/10.3.282 schema:sameAs https://app.dimensions.ai/details/publication/pub.1027582978
94 rdf:type schema:CreativeWork
95 https://doi.org/10.1109/tc.1979.1675240 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061532177
96 rdf:type schema:CreativeWork
97 https://doi.org/10.1145/245.246 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030670208
98 rdf:type schema:CreativeWork
99 https://doi.org/10.1145/245.248 schema:sameAs https://app.dimensions.ai/details/publication/pub.1041471884
100 rdf:type schema:CreativeWork
101 https://doi.org/10.1145/282918.282943 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020090289
102 rdf:type schema:CreativeWork
103 https://doi.org/10.1145/359423.359432 schema:sameAs https://app.dimensions.ai/details/publication/pub.1001254099
104 rdf:type schema:CreativeWork
105 https://doi.org/10.1147/sj.41.0025 schema:sameAs https://app.dimensions.ai/details/publication/pub.1063184673
106 rdf:type schema:CreativeWork
 




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


...