Skip to main content
SpringerLink
Log in

A generic method to organize boundaries of complex polygons for embedded devices

  • Original Paper
  • Published:
Arabian Journal of Geosciences Aims and scope Submit manuscript

Abstract

Based on an analysis of drawbacks in the existing graphical display of complex area objects in embedded system, the paper introduces a new method termed as consecutive boundary organization (CBO) which is able to convert a large number of separate polygons belonging to the same area object into a single consecutive stroke fitting for quick display. The working principle of the CBO method is demonstrated in three cases that can typically occur to the real-world concept “lake”: (1) a lake with an island in it, (2) a lake with multiple islands, and (3) the nested lake-island-lake. In spite of complicated inclusion relationships, the CBO method can always construct an integral stroke with neither information loss nor redundancy. Experiments with a real dataset of lakes and islands from North America have proved the feasibility and efficiency of the CBO method. Due to its generic nature, the CBO method can be applied to any other complex area objects with multiple polygons and inclusion levels.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Berg M, Van Kreveld M, Overmars M, Schwarzkopf O (1997) Computational geometry: algorithms and applications, 2nd edn. Springer, New York

    Book  Google Scholar 

  • Bessmeltsev M, Wang C, Sheffer A, Singh K (2012) Design-driven quadrangulation of closed 3D curves. ACM Trans Graph 31(6) ACM

  • Buttenfield BP, McMaster RB (2001) Map generalization: making rules for knowledge representation. Longman Scientific & Technical, New York

    Google Scholar 

  • Cormen H, Leiserson E, Rivest L, Stein C (2001) Minimum spanning trees. Introduction to algorithms, 2nd edn, vol. 23. MIT Press, Cambridge, pp 561–579

  • Funkhouser A, Séquin H (1993) Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. Proceedings of SIGGRAPH 93:247–254

  • Li G, Liu L (2013) Geometry curves: a compact representation for 3D shapes, Graphical models, vol 75, No. 5. ACM, New York, pp 265–278

    Google Scholar 

  • Liang J, Gong J, Li W, Ibrahim AN (2014) A visualization-oriented 3D method for efficient computation of urban solar radiation based on 3D–2D surface mapping. Int J Geogr Inf Sci 28(4):780–798 Taylor & Francis

    Article  Google Scholar 

  • McCallum D, Avis D (1979) A linear algorithm for finding the convex hull of a simple polygon. Inf Process Lett 9:201–206

    Article  Google Scholar 

  • McGraw H (2006) McGraw Hill encyclopedia of science and technology. McGraw-Hill Professional Press, New York

    Google Scholar 

  • Megiddo N, Tamir A (1993) Linear time algorithms for some separable quadratic programming problems. Oper Res Lett 13(4):203–211

    Article  Google Scholar 

  • Nakamura Y, Mizuta S, Matsuda T (2006) Simplification and visualization of 3D digital images using region-based contour trees, IPSJ SIG Technical Reports, 2006(119)(CG-125), 59–64

  • Parker G, Franck G, Ware C (1998) Visualization of large nested graphs in 3D: navigation and interaction. J Vis Lang Comput 9(3):299–317

    Article  Google Scholar 

  • Samet H (2000) The design and analysis of spatial data structures. Addison-Wesley, Reading

    Google Scholar 

  • Sibbing D, Kobbelt L (2007) Fast interactive region of interest selection for volume visualization. Bildverarbeitung für die Medizin 12:338–342

    Google Scholar 

  • Sickel V (2004) GIS basis. CRC, Boca Raton

    Google Scholar 

  • Tang R (2001) Computer graphics tutorial. Science Press, Beijing

    Google Scholar 

  • Wu J, Leou J (1993) New polygonal approximation schemes for object shape representation. Pattern Recogn 26(4):471–484

    Article  Google Scholar 

  • Zhang J, Zhu Y (2015) A method based on graphic entity for visualizing complex map symbols on the web. Cartogr Geogr Inf Sci 42(1):44–53 Taylor & Francis

    Article  Google Scholar 

Download references

Funding

The research described in this article was co-sponsored by (1) a joint research program among Wuhan KOTEI Technology Corporation, Technische Universität München, and Hubei University of Technology and supported by (2) National High Technology Research and Development Program of China (No. 2015AA124002) and (3) National Natural Science Foundation of China (No. 41301424).

Author information

Authors and Affiliations

  1. School of Computer Science, Hubei University of Technology, Wuhan, China

    Hongbo Gong & Jianfei Wang

  2. School of Human Settlements and Civil Engineering, Xi’An Jiaotong University, Xi’an, China

    Meng Zhang

  3. Department of Cartography, Technische Universität München, Munich, Germany

    Liqiu Meng

Authors
  1. Hongbo Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianfei Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Liqiu Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Meng Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gong, H., Zhang, M., Wang, J. et al. A generic method to organize boundaries of complex polygons for embedded devices. Arab J Geosci 11, 238 (2018). https://doi.org/10.1007/s12517-018-3575-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12517-018-3575-6

Keywords

Search

Navigation