<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-23T20:02:59Z</responseDate>
  <request identifier="9369" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:9369</identifier>
        <datestamp>2024-03-06T10:44:09Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Center Point of Simple Area Feature Based on Triangulation Skeleton Graph (Short Paper)</dc:title>
          <dc:creator>Lu, Wei</dc:creator>
          <dc:creator>Ai, Tinghua</dc:creator>
          <dc:subject>Shape Center</dc:subject>
          <dc:subject>Triangulation Skeleton Graph</dc:subject>
          <dc:subject>Graph Centrality</dc:subject>
          <dc:description>In the area of cartography and geographic information science, the center points of area features are related to many fields. The centroid is a conventional choice of center point of area feature. However, it is not suitable for features with a complex shape for the center point may be outside the area or not fit the visual center so well. This paper proposes a novel method to calculate the center point of area feature based on triangulation skeleton graph. This paper defines two kinds of centrality of vertices in skeleton graph according to the centrality theory in graph and network analysis. Through the measurement of vertices centrality, the center points of polygon area features are defined as the vertices with maximum centrality.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Wei Lu and Tinghua Ai</dc:contributor>
          <dc:date>2018</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 114, 10th International Conference on Geographic Information Science (GIScience 2018)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.GISCIENCE.2018.41</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-93699</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GISCIENCE.2018.41</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
