期刊文献+

带线段障碍的城市Voronoi图生成算法研究 被引量:2

ON GENERATION ALGORITHM OF CITY VORONOI DIAGRAM WITH LINE SEGMENT OBSTACLE
下载PDF
导出
摘要 带线段障碍的城市Voronoi图是城市Voronoi图的扩展。在步行或使用一般交通工具的情况下,客观世界中存在着许多不能逾越的障碍,甚至连交通网络也时常被一些障碍隔开。许多障碍可简化为线段障碍来处理。给出带线段障碍的城市Voronoi图的定义、性质,结晶生长算法和实例。算法简单,可扩展性好,具有较高的理论价值和应用价值。 The city Voronoi diagram with line segment obstacle is the development of the city Voronoi diagram. In real world when walking or general transportation vehicles are the common situation, there are lots of impassable obstacles, even traffic network can be spaced by obstacles either. Many obstacles can be handled as the simplified line segment obstacles, This text gives the definition, the nature, crystal growth algorithm of the city Voronoi diagram with line segment obstacles and its practice program. The method is simple, good in scalability, and is of high value in practice and theory.
出处 《计算机应用与软件》 CSCD 北大核心 2008年第11期249-252,共4页 Computer Applications and Software
关键词 计算几何 VORONOI图 线段障碍 结晶生长 Computational geomtery Voronoi diagram Line segment obstacle Crystal growth
  • 相关文献

参考文献4

  • 1Kei Kobayashi, Kokichi Sugihara. Crystal Voronoi Diagram and Its Ap- plications to Collision-Free Paths. Lecture Notes in Computer Science, 2001:738 - 747.
  • 2Lingas A. Voronoi diagram with barriers and their applications. Manuscript, 1986.
  • 3Tane Pendragon, Lyndon While. Path-planning by Tessellation of Obstacles. Australian Computer Society,2003.
  • 4Vomnoi. Nouvelles applications des parameters continus a la theorie des formes quadratiques. Deuxieme Memoire : Recherches sur les parallelloedres primitives,J. Reine Angew. Math., 1908:134,198 - 287. 1909 : 136,67 - 181.

同被引文献16

  • 1李智.基于蚁群算法的煤炭运输优化方法[J].中国铁道科学,2004,25(3):126-129. 被引量:10
  • 2郭鹏.煤炭运输问题的数学模型及求解的计算和程序[J].煤炭技术,1996,15(3):44-45. 被引量:1
  • 3Aurenhamrner EVoronoi diagrams-a survey of a funda- mental geometric data structure[J].ACM Computing Sur- veys, 1991,23:345-405.
  • 4Okabe A.Spatial tessellations: concepts and applications of Voronoi diagrams[M].[S.1.] : John Wiley and Sons, 1992 : 1-410.
  • 5Kobayashi K, Sugihara K.Crystal Voronoi diagram and its applications to collision—free paths[C]//Lecture Notes in Computer Science,2001,2073 : 738-747.
  • 6Okabe A, Satoh T,Furuta T, et al.Generalized network Voronoi diagrams: concepts, computational methods and applications[J].International Journal of Geographical Information Science, 2008,22.
  • 7Aichholzer O, Aurenhammer F, Palop B.Quickest paths, straight skeletons and the city Voronoi diagram[J].Dis- crete and Computational Geometry, 2004,31 ( 1 ) : 17-35.
  • 8Aurenhammer F, Edelsbnmner H.An optiomal algorithm for constructing the weighted Voronoi diagram in the plane[J].Pattem Recognition, 1984, 17: 251-257.
  • 9Lingas A.Voronoi diagram with barriers and their appli- cations[J].lnform Process Lett, 1989,32: 191-198.
  • 10BARRY J, WANG C A. Duality of Constrained Voronoi Diagrams and Delaunay Triangulations[J]. Algorithmica, 1999, 9 (2): 142-155.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部