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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to Theory of NP-Completeness. Freeman, New York (1979)
Gilbert, P.D.: New Results in Planar Triangulations. Report R-850. University of Illinois, Coordinated Science Lab (1979)
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)
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)
Klincsek, G.T.: Minimal Triangulations of Polygonal Domains. Annals of Discrete Mathematics 9, 121–123 (1980)
Lodi, E., Luccio, F., Mugnai, C., Pagli, L.: On Two-Dimensional Data Organization, Part I. Fundaments Informaticae 2, 211–226 (1979)
Lubiw, A.: The Boolean Basis Problem and How to Cover Some Polygons by Rectangles. SIAM Journal on Discrete Mathematics 3, 98–115 (1990)
Moitra, D.: Finding a Minimum Cover for Binary Images: An Optimal Parallel Algorithm. Algorithmica 6, 624–657 (1991)
Plaisted, D., Hong, J.: A Heuristic Triangulation Algorithm. Journal of Algorithms 8, 405–437 (1987)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)