Automatic seamless matching of area boundaries View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2018-11-07

AUTHORS

Shaozhong Shi

ABSTRACT

In big vectoriesed digital maps, a great number of overlaps and gaps may occur at the boundaries between adjacent polygons. Not only can it be a mammoth and tedious task to carry out editing tasks by hand, but also the process of editing for aligning boundaries seamlessly may alter the position of anchoring points and lead to introduction of errors. In particular, anchoring points for boundaries of polygons may have legal implications. For instance, anchoring points may represent the positions of demarcation poles or stones. Hitherto, there has not yet been a total solution for automatic handling of problems of boundary conflicts between adjacent area features. One may attempt to use snapping (ESRI 2018) or edit positions of anchoring points to re-align boundary line segments to form perfect matches of boundary lines. However, this may incur yet another problem of introducing alteration of boundary defining points through adding, deleting or moving the positions of anchoring points. How to automate the process of aligning boundary lines between adjacent area features for seamless matching poses a major challenge to the design of an algorithm and programmatic solutions. This paper presents a new solution for achieving automated seamless matching of area boundaries without adding, deleting or moving any anchoring point. It is believed it is interesting to a wide range of professionals working in the fields of spatial science, Geographical Information System, cartography and land and property registry. More... »

PAGES

1-4

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/s12145-018-0373-3

DOI

http://dx.doi.org/10.1007/s12145-018-0373-3

DIMENSIONS

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


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/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "University of Essex", 
          "id": "https://www.grid.ac/institutes/grid.8356.8", 
          "name": [
            "University of Essex, Wivenhoe Park, CO4 3SQ, Colchester, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Shi", 
        "givenName": "Shaozhong", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1179/1743277411y.0000000016", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1025961079"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2018-11-07", 
    "datePublishedReg": "2018-11-07", 
    "description": "In big vectoriesed digital maps, a great number of overlaps and gaps may occur at the boundaries between adjacent polygons. Not only can it be a mammoth and tedious task to carry out editing tasks by hand, but also the process of editing for aligning boundaries seamlessly may alter the position of anchoring points and lead to introduction of errors. In particular, anchoring points for boundaries of polygons may have legal implications. For instance, anchoring points may represent the positions of demarcation poles or stones. Hitherto, there has not yet been a total solution for automatic handling of problems of boundary conflicts between adjacent area features. One may attempt to use snapping (ESRI 2018) or edit positions of anchoring points to re-align boundary line segments to form perfect matches of boundary lines. However, this may incur yet another problem of introducing alteration of boundary defining points through adding, deleting or moving the positions of anchoring points. How to automate the process of aligning boundary lines between adjacent area features for seamless matching poses a major challenge to the design of an algorithm and programmatic solutions. This paper presents a new solution for achieving automated seamless matching of area boundaries without adding, deleting or moving any anchoring point. It is believed it is interesting to a wide range of professionals working in the fields of spatial science, Geographical Information System, cartography and land and property registry.", 
    "genre": "research_article", 
    "id": "sg:pub.10.1007/s12145-018-0373-3", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": false, 
    "isFundedItemOf": [
      {
        "id": "sg:grant.3982816", 
        "type": "MonetaryGrant"
      }
    ], 
    "isPartOf": [
      {
        "id": "sg:journal.1049211", 
        "issn": [
          "1865-0473", 
          "1865-0481"
        ], 
        "name": "Earth Science Informatics", 
        "type": "Periodical"
      }
    ], 
    "name": "Automatic seamless matching of area boundaries", 
    "pagination": "1-4", 
    "productId": [
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "47d119b242603515e8d23bd9484ea6131d3faf1741ae0d142c6d83cba0c61b39"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s12145-018-0373-3"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1109759776"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s12145-018-0373-3", 
      "https://app.dimensions.ai/details/publication/pub.1109759776"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2019-04-10T14:24", 
    "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_8660_00000610.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://link.springer.com/10.1007%2Fs12145-018-0373-3"
  }
]
 

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/s12145-018-0373-3'

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/s12145-018-0373-3'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s12145-018-0373-3'

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

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s12145-018-0373-3'


 

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

59 TRIPLES      21 PREDICATES      25 URIs      16 LITERALS      5 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/s12145-018-0373-3 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N896c149cdeec45298f2bfa518a4670d2
4 schema:citation https://doi.org/10.1179/1743277411y.0000000016
5 schema:datePublished 2018-11-07
6 schema:datePublishedReg 2018-11-07
7 schema:description In big vectoriesed digital maps, a great number of overlaps and gaps may occur at the boundaries between adjacent polygons. Not only can it be a mammoth and tedious task to carry out editing tasks by hand, but also the process of editing for aligning boundaries seamlessly may alter the position of anchoring points and lead to introduction of errors. In particular, anchoring points for boundaries of polygons may have legal implications. For instance, anchoring points may represent the positions of demarcation poles or stones. Hitherto, there has not yet been a total solution for automatic handling of problems of boundary conflicts between adjacent area features. One may attempt to use snapping (ESRI 2018) or edit positions of anchoring points to re-align boundary line segments to form perfect matches of boundary lines. However, this may incur yet another problem of introducing alteration of boundary defining points through adding, deleting or moving the positions of anchoring points. How to automate the process of aligning boundary lines between adjacent area features for seamless matching poses a major challenge to the design of an algorithm and programmatic solutions. This paper presents a new solution for achieving automated seamless matching of area boundaries without adding, deleting or moving any anchoring point. It is believed it is interesting to a wide range of professionals working in the fields of spatial science, Geographical Information System, cartography and land and property registry.
8 schema:genre research_article
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf sg:journal.1049211
12 schema:name Automatic seamless matching of area boundaries
13 schema:pagination 1-4
14 schema:productId N9c35cc29444e4326b85c830b893f3f6e
15 Nd97ed6a221d24dfb88d9ef5ad9412c75
16 Ne2375a0e4cd44c7d990ed324bad5b848
17 schema:sameAs https://app.dimensions.ai/details/publication/pub.1109759776
18 https://doi.org/10.1007/s12145-018-0373-3
19 schema:sdDatePublished 2019-04-10T14:24
20 schema:sdLicense https://scigraph.springernature.com/explorer/license/
21 schema:sdPublisher N7e205d96c0bc4ec4a136742419d7f554
22 schema:url https://link.springer.com/10.1007%2Fs12145-018-0373-3
23 sgo:license sg:explorer/license/
24 sgo:sdDataset articles
25 rdf:type schema:ScholarlyArticle
26 N7e205d96c0bc4ec4a136742419d7f554 schema:name Springer Nature - SN SciGraph project
27 rdf:type schema:Organization
28 N896c149cdeec45298f2bfa518a4670d2 rdf:first Ne05b3255aac943f2941c43ead3e373df
29 rdf:rest rdf:nil
30 N9c35cc29444e4326b85c830b893f3f6e schema:name dimensions_id
31 schema:value pub.1109759776
32 rdf:type schema:PropertyValue
33 Nd97ed6a221d24dfb88d9ef5ad9412c75 schema:name doi
34 schema:value 10.1007/s12145-018-0373-3
35 rdf:type schema:PropertyValue
36 Ne05b3255aac943f2941c43ead3e373df schema:affiliation https://www.grid.ac/institutes/grid.8356.8
37 schema:familyName Shi
38 schema:givenName Shaozhong
39 rdf:type schema:Person
40 Ne2375a0e4cd44c7d990ed324bad5b848 schema:name readcube_id
41 schema:value 47d119b242603515e8d23bd9484ea6131d3faf1741ae0d142c6d83cba0c61b39
42 rdf:type schema:PropertyValue
43 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
44 schema:name Information and Computing Sciences
45 rdf:type schema:DefinedTerm
46 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
47 schema:name Artificial Intelligence and Image Processing
48 rdf:type schema:DefinedTerm
49 sg:grant.3982816 http://pending.schema.org/fundedItem sg:pub.10.1007/s12145-018-0373-3
50 rdf:type schema:MonetaryGrant
51 sg:journal.1049211 schema:issn 1865-0473
52 1865-0481
53 schema:name Earth Science Informatics
54 rdf:type schema:Periodical
55 https://doi.org/10.1179/1743277411y.0000000016 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025961079
56 rdf:type schema:CreativeWork
57 https://www.grid.ac/institutes/grid.8356.8 schema:alternateName University of Essex
58 schema:name University of Essex, Wivenhoe Park, CO4 3SQ, Colchester, UK
59 rdf:type schema:Organization
 




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


...