24小时热门版块排行榜

返回列表

本帖产生 1 个 LS-EPI ，点击这里进行查看

yudingjian

木虫 (著名写手)

应助: 0 (幼儿园)
金币: 4365.5
散金: 120
红花: 1
帖子: 2778
在线: 438.5小时
虫号: 82027
注册: 2005-07-23
性别: GG
专业: 地理信息系统

[求助] 求助：下面这篇文章被EI数据库收录了吗

下面这篇文章被EI数据库收录了吗

题目：Point-in-polygon algorithm based on monolithic calculation for included angle of half plane continuous chains
作者：Jian Ding 等

回复此楼

» 猜你喜欢

真诚求助：手里的省社科项目结项要求主持人一篇中文核心，有什么渠道能发核心吗已经有8人回复
寻求一种能扛住强氧化性腐蚀性的容器密封件已经有5人回复
论文投稿，期刊推荐已经有6人回复
请问哪里可以有青B申请的本子可以借鉴一下。已经有4人回复
孩子确诊有中度注意力缺陷已经有14人回复
请问下大家为什么这个铃木偶联几乎不反应呢已经有5人回复
请问有评职称，把科研教学业绩算分排序的高校吗已经有5人回复
2025冷门绝学什么时候出结果已经有3人回复
天津工业大学郑柳春团队欢迎化学化工、高分子化学或有机合成方向的博士生和硕士生加入已经有4人回复
康复大学泰山学者周祺惠团队招收博士研究生已经有6人回复

1楼2012-04-21 08:09:13

已阅回复此楼关注TA 给TA发消息送TA红花 TA的回帖

baiyuefei

版主 (文学泰斗)

风雪

LS-EPI: 1647
应助: 4642 (副教授)
贵宾: 46.969
金币: 657568
散金: 11616
红花: 995
沙发: 81
帖子: 69374
在线: 13266.5小时
虫号: 676696
注册: 2008-12-18
性别: GG
专业: 合成药物化学
管辖: 有机交流

【答案】应助回帖

★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★
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.