Skip to main content
SpringerLink
Log in

Route Standardization Based on Polygon Triangulation Cutting Algorithm

  • Conference paper
Information Computing and Applications (ICICA 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 391))

Included in the following conference series:

Abstract

Polygon triangulation cutting algorithm has been widely used because of its excellent characteristics. The method is introduced into route standardization in this paper. Firstly, triangulate the polygon composed by Geometric points with Displacement and time by using Polygon triangulation cutting algorithm. Use the formula to calculate division of the triangle area, and then compute the area of the whole polygon. We can get n different polygons by scanning different period, repeat the algorithm and we can get the area of n polygons. Through the weighted average method to get the best a group of polygon set point, which composed the best path. The results of the experiments prove the validity of the method.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aichholzer, O., Rote, G., Speckmann, B., Streinu, I.: The Zigzag Path of a Pseudo-Triangulation. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 377–388. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)

    Book  MATH  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  4. Gilbert, P.D.: New Results in Planar Triangulations. Report R-850. University of Illinois, Coordinated Science Lab (1979)

    Google Scholar 

  5. Grantson, M., Borgelt, C., Levcopoulos, C.: A Fixed Parameter Algorithm for Minimum Weight Triangulation: Analysis and Experiments. Technical Report LUCS-TR: 2005-234, ISSN 1650-1276 Report 154. Lund University, Sweden (2005)

    Google Scholar 

  6. Hoffmann, M., Okamoto, Y.: The Minimum Weight Triangulation Problem with Few Inner Points. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 200–212. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  7. Klincsek, G.T.: Minimal Triangulations of Polygonal Domains. Annals of Discrete Mathematics 9, 121–123 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lodi, E., Luccio, F., Mugnai, C., Pagli, L.: On Two-Dimensional Data Organization, Part I. Fundaments Informaticae 2, 211–226 (1979)

    MATH  Google Scholar 

  9. Lubiw, A.: The Boolean Basis Problem and How to Cover Some Polygons by Rectangles. SIAM Journal on Discrete Mathematics 3, 98–115 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  10. Moitra, D.: Finding a Minimum Cover for Binary Images: An Optimal Parallel Algorithm. Algorithmica 6, 624–657 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  11. Plaisted, D., Hong, J.: A Heuristic Triangulation Algorithm. Journal of Algorithms 8, 405–437 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  12. Sharir, M., Welzl, E.: On the Number of Crossing-Free Matchings (Cycles and Partitions). In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006 (to appear, 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shi Jiazhuang Post & Telecommunication Technical College, 050021, Shijiazhuang, China

    Baozhu Zhao, Huifeng Zhang, Yanfeng Jin & Yanling Su

Authors
  1. Baozhu Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Huifeng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanfeng Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yanling Su
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Shanghai Jiao Tong University, 800 Dongchuan Road, Dianxinqunlou 1-401, 200240, Shanghai, China

    Yuhang Yang

  2. School of Electrical and Electronic Engineering, Nanyang Technological University, Nanyang Avenue, 639798, Singapore, Singapore

    Maode Ma

  3. College of Science, Hebei United University, 063009, Tangshan, Hebei, China

    Baoxiang Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, B., Zhang, H., Jin, Y., Su, Y. (2013). Route Standardization Based on Polygon Triangulation Cutting Algorithm. In: Yang, Y., Ma, M., Liu, B. (eds) Information Computing and Applications. ICICA 2013. Communications in Computer and Information Science, vol 391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53932-9_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-53932-9_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-53931-2

  • Online ISBN: 978-3-642-53932-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation