Center Point of Simple Area Feature Based on Triangulation Skeleton Graph (Short Paper)

Authors Wei Lu , Tinghua Ai

Thumbnail PDF


  • Filesize: 455 kB
  • 6 pages

Document Identifiers

Author Details

Wei Lu
  • Wuhan University, Wuhan, China
Tinghua Ai
  • Wuhan University, Wuhan, China

Cite AsGet BibTex

Wei Lu and Tinghua Ai. Center Point of Simple Area Feature Based on Triangulation Skeleton Graph (Short Paper). In 10th International Conference on Geographic Information Science (GIScience 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 114, pp. 41:1-41:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


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.

Subject Classification

ACM Subject Classification
  • Information systems → Geographic information systems
  • Shape Center
  • Triangulation Skeleton Graph
  • Graph Centrality


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Tinghua Ai and Peter van Oosterom. Gap-tree extensions based on skeletons. In Advances in Spatial Data Handling, pages 501-513. Springer, Berlin, Heidelberg, 2002. URL:
  2. Wolfgang Aigner, Franz Aurenhammer, and Bert Jüttler. On triangulation axes of polygons. Information Processing Letters, 115(1):45-51, 2015. URL:
  3. Xiang Bai and Longin Jan Latecki. Path similarity skeleton graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(7):1282-1292, 2008. URL:
  4. Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. Computational Geometry: Algorithms and Applications. Springer, Santa Clara, CA, USA, 3 edition, 2008. Google Scholar
  5. Harry Blum. Biological shape and visual science (part 1). Journal of Theoretical Biology, 38(2):205-287, 1973. URL:
  6. Stephen P. Borgatti and Martin G. Everett. A graph-theoretic perspective on centrality. Social Networks, 28(4):466-484, 2006. URL:
  7. Tao Chen and Tinghua Ai. Automatic extraction of skeleton and center of area feature. Geomatics and Information Science of Wuhan University, 29(5):443, 2004. URL:
  8. Jesús A. De Loera, Jörg Rambau, and Francisco Santos. Triangulations:Structures for Algorithms and Applications, volume 25 of Algorithms and Computation in Mathematics. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010. URL:
  9. Daniel Garcia-Castellanos and Umberto Lombardo. Poles of inaccessibility: A calculation algorithm for the remotest places on earth. Scottish Geographical Journal, 123(3):227-233, 2007. URL:
  10. Bin Jiang and Xintao Liu. Scaling of geographic space from the perspective of city and field blocks and using volunteered geographic information. International Journal of Geographical Information Science, 26(2):215-229, feb 2012. URL:
  11. Jia-Guu Leu. Computing a shape’s moments from its boundary. Pattern Recognition, 24(10):949-957, jan 1991. URL: