| ²é¿´: 979 | »Ø¸´: 4 | ||
| ±¾Ìû²úÉú 1 ¸ö LS-EPI £¬µã»÷ÕâÀï½øÐв鿴 | ||
| µ±Ç°Ö»ÏÔʾÂú×ãÖ¸¶¨Ìõ¼þµÄ»ØÌû£¬µã»÷ÕâÀï²é¿´±¾»°ÌâµÄËùÓлØÌû | ||
yudingjianľ³æ (ÖøÃûдÊÖ)
|
[ÇóÖú]
ÇóÖú£ºÏÂÃæÕâÆªÎÄÕ±»EIÊý¾Ý¿âÊÕ¼ÁËÂð
|
|
|
ÏÂÃæÕâÆªÎÄÕ±»EIÊý¾Ý¿âÊÕ¼ÁËÂð ÌâÄ¿£ºPoint-in-polygon algorithm based on monolithic calculation for included angle of half plane continuous chains ×÷ÕߣºJian Ding µÈ |
» ²ÂÄãϲ»¶
²ÄÁÏÓ뻯¹¤¿¼Ñе÷¼Á
ÒѾÓÐ3È˻ظ´
081700 µ÷¼Á 267·Ö
ÒѾÓÐ3È˻ظ´
Ò»Ö¾Ô¸ÖØÇì´óѧ085700×ÊÔ´Óë»·¾³£¬×Ü·Ö308Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
336»¯¹¤µ÷¼Á
ÒѾÓÐ4È˻ظ´
276Çóµ÷¼Á¡£ÓаëÄêµç³ØºÍ°ëÄê¸ß·Ö×Óʵϰ¾Àú
ÒѾÓÐ7È˻ظ´
08¹¤Ñ§µ÷¼Á
ÒѾÓÐ10È˻ظ´
263Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
298Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
¿¼Ñл¯Ñ§308·ÖÇóµ÷¼Á
ÒѾÓÐ6È˻ظ´
0854 ¿¼Ñе÷¼Á ÕÐÉúÁË£¡AI ·½Ïò
ÒѾÓÐ13È˻ظ´
baiyuefei
°æÖ÷ (ÎÄѧ̩¶·)
·çÑ©
- LS-EPI: 1647
- Ó¦Öú: 4642 (¸±½ÌÊÚ)
- ¹ó±ö: 46.969
- ½ð±Ò: 658104
- É¢½ð: 11616
- ºì»¨: 995
- ɳ·¢: 81
- Ìû×Ó: 69424
- ÔÚÏß: 13328.3Сʱ
- ³æºÅ: 676696
- ×¢²á: 2008-12-18
- ÐÔ±ð: GG
- רҵ: ºÏ³ÉÒ©Îﻯѧ
- ¹ÜϽ: Óлú½»Á÷
3Â¥2012-04-21 08:46:13
baiyuefei
°æÖ÷ (ÎÄѧ̩¶·)
·çÑ©
- LS-EPI: 1647
- Ó¦Öú: 4642 (¸±½ÌÊÚ)
- ¹ó±ö: 46.969
- ½ð±Ò: 658104
- É¢½ð: 11616
- ºì»¨: 995
- ɳ·¢: 81
- Ìû×Ó: 69424
- ÔÚÏß: 13328.3Сʱ
- ³æºÅ: 676696
- ×¢²á: 2008-12-18
- ÐÔ±ð: GG
- רҵ: ºÏ³ÉÒ©Îﻯѧ
- ¹ÜϽ: Óлú½»Á÷
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï ¡ï
yudingjian: ½ð±Ò+10, ¡ï¡ï¡ï¡ï¡ï×î¼Ñ´ð°¸, ·Ç³£¸Ðл£¡ 2012-04-21 09:44:21
452612957: ½ð±Ò+1, ¼ìË÷EPI+1, ллӦÖú£¬¹ÄÀøÒ»ÏÂ~ 2012-04-21 12:33:23
yudingjian: ½ð±Ò+10, ¡ï¡ï¡ï¡ï¡ï×î¼Ñ´ð°¸, ·Ç³£¸Ðл£¡ 2012-04-21 09:44:21
452612957: ½ð±Ò+1, ¼ìË÷EPI+1, ллӦÖú£¬¹ÄÀøÒ»ÏÂ~ 2012-04-21 12:33:23
|
ÊÕ¼ÁË£¬È·¶¨¡£ÈçÏ Search History - Selected Records - My Profile - My Alerts Abstract - Detailed - Record 1 from Compendex for: ((Point-in-polygon algorithm based on monolithic calculation for included angle of half plane continuous chains) WN TI), 1969-2012 Check record to add to Selected Records 1. Accession number: 20104313318878 Title: Point-in-polygon algorithm based on monolithic calculation for included angle of half plane continuous chains Authors: Ding, Jian1 ; Wu, Kehong1 ; Guan, Hongjun1 ; Wang, Daqing1 ; Rui, Ting1 Author affiliation: 1 Engineering Institute of Corps of Engineers, PLA Univ. of Sci. and Tech., Nanjing, China Corresponding author: Ding, J. (yudingjian@sina.com.cn) Source title: 2010 18th International Conference on Geoinformatics, Geoinformatics 2010 Abbreviated source title: Int. Conf. Geoinformatics, Geoinformatics Monograph title: 2010 18th International Conference on Geoinformatics, Geoinformatics 2010 Issue date: 2010 Publication year: 2010 Article number: 5567887 Language: English ISBN-13: 9781424473021 Document type: Conference article (CA) Conference name: 2010 18th International Conference on Geoinformatics, Geoinformatics 2010 Conference date: June 18, 2010 - June 20, 2010 Conference location: Beijing, China Conference code: 81943 Sponsor: IEEE GRSS; The Geographical Society of China Publisher: IEEE Computer Society, 445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States Abstract: The point-in-polygon test which query about whether a point lies within a polygon or not is a fundamental problem in geometry, and of importance in various applications in GIS (Geographic Information System) and other areas. In taking advantage of the basic idea of the sum of included angle algorithm, a novel improvement for the point-in-polygon test is proposed in this paper. A new concept, the half plane continuous chain is presented, the continuous segments whose endpoints lies similar side by the line through the tested point will be organized as a half plane continuous chain. The monolithic calculation method of included angle for half plane continuous chain is founded, which accumulate the included angle value of each contained edge by directly calculating the included angle between the two endpoints of half plane continuous chains, all intermediate edges' included angle value calculation in each half plane continuous chain are omitted. As a result, the computation time is cut down. The improved algorithm for inclusion test consisting of three phases: (1) organizing edges of a polygon into a minimal number of half plane continuous chains and (2) calculating each chain's included angle value, and accumulating them to a sum and (3) comparing the sum with the constant: ¡À2¦Ð (or ¡À360¡ã) means included and 0 means not. In the first phase, the computer for splitting polygonal chains into half plane continuous chain will just process Boolean compares. In the second phase, the included angle computation and accumulating times ranges from 0 to 2m, depending on the geometry of the polygon and the test direction, here, m is the fewer number of half plane continuous chains and is always smaller, often much smaller, than the number n of edges. In the case of afield polygon and convex polygon, the number of included angle calculating and accumulating times could be reduced from n to 0 or 5. Analysis shows except in the case of saw-shaped polygon, the improved algorithm is faster than the original in most cases, especially for polygons with large amounts of edges. Number of references: 8 Main heading: Testing Controlled terms: Algorithms - Geographic information systems Uncontrolled terms: Basic idea - Calculation methods - Computation time - Convex polygon - Fundamental problem - GIS (geographic information system) - Half plane continuous chain - Half-planes - Improved algorithm - Inclusion test - Monolithic calculation - Point-in-polygon test - Polygonal chains - Second phase - Sum of included angle - Three phasis Classification code: 423.2 Non Mechanical Properties of Building Materials: Test Methods - 723 Computer Software, Data Handling and Applications - 723.3 Database Systems - 921 Mathematics DOI: 10.1109/GEOINFORMATICS.2010.5567887 Database: Compendex Compilation and indexing terms, © 2012 Elsevier Inc. Tools in Scopus Author Details: View Author Details in Scopus; Ding, J. Wu, K. Guan, H. Wang, D. Rui, T. View All Authors Learn more about Scopus Add a tag PublicPrivateMy InstitutionLogin for groups del.icio.us Full-text and Local Holdings Links FULL TEXT LINKS About Ei - About Engineering Village - Feedback - Privacy Policy - Terms and Conditions © 2012 Elsevier Inc. All rights reserved. |
2Â¥2012-04-21 08:46:02
baiyuefei
°æÖ÷ (ÎÄѧ̩¶·)
·çÑ©
- LS-EPI: 1647
- Ó¦Öú: 4642 (¸±½ÌÊÚ)
- ¹ó±ö: 46.969
- ½ð±Ò: 658104
- É¢½ð: 11616
- ºì»¨: 995
- ɳ·¢: 81
- Ìû×Ó: 69424
- ÔÚÏß: 13328.3Сʱ
- ³æºÅ: 676696
- ×¢²á: 2008-12-18
- ÐÔ±ð: GG
- רҵ: ºÏ³ÉÒ©Îﻯѧ
- ¹ÜϽ: Óлú½»Á÷
4Â¥2012-04-21 08:47:14













»Ø¸´´ËÂ¥
10