期刊文献+

利用Voronoi图解决城市绿化问题

Using Voronoi Diagram to Solve Urban Greening Problem
下载PDF
导出
摘要 Voronoi图是一种平面分割图,它的剖分结果能够很好地表达点与点之间的邻近关系以及点的影响范围等重要的空间信息.而线段加权Voronoi图是对普通Voronoi图在生成元以及权重两方面加以推广而产生的.本文给出了如何用离散的方法来生成线段加权Voronoi图.针对城市中绿化带选址规划这一城市绿化规划工作中的重要环节,提出了一种基于线段加权Voronoi图的规划方法,更合理地进行绿化场所选址问题. Voronoi diagram is a kind of plane segmentation image. Its split results perfectly express point and point between the adjacent relation and the influence space of the point. Line segment weighted Voronoi diagram is an important generalization of the ordinary Voronoi diagram in two sides of building element and weight. This paper shows how to use the discrete method to realize line segment weighted Voronoi diagram. Aiming at the important link of work to choose the site green belts of the city, one method based on the line segment weighted Voronoi diagramis proposed, which is more reasonable to choose the site of the greening place location.
作者 庞慧 王庆林
出处 《河北建筑工程学院学报》 CAS 2012年第4期80-83,共4页 Journal of Hebei Institute of Architecture and Civil Engineering
基金 张家口市科技技术研究与发展指导计划项目(1101005B)
关键词 VORONOI图 线段加权Voronoi图 离散 绿化规划 Voronoi diagram Line segment weighted Voronoi diagram discrete method green planning
  • 相关文献

参考文献5

二级参考文献10

  • 1张有会.线段加权的Voronoi图[J].计算机学报,1995,18(11):822-829. 被引量:30
  • 2李武龙 陈军.线状障碍物的可视最短路径Voronoi图的生成[J].Journal of Wuhan Technical University of Surveying and Mapping,2.
  • 3Kei Kobayashi,Kokichi Sugihara.Crystal Voronoi Diagram and Its Applications to Collision-Free Paths.Lecture Notes in Computer Science,2073,Computational Science-ICCS,2001:738-747.
  • 4[1]Sugihara K., Approximation of generalized Voronoi diagrauns by ordinary Voronoi diagrams [ J ]. Computer Vision, Graphics, and Image ProcessingGraphical Models and Image Processing, 1993,55:522 ~ 531.
  • 5[2]Takafumi Watanabe and Sadayuki Murashima, A method to construct a Voronoi diagram on 2-D digitized space O(1) computing time[J] .Faculty of Engineering, Kagoshirna University, Kagoshimashi, 1996, J79 - D - I (3):114 ~ 112.
  • 6[3]Kazuhiro Yamada and Kokichi Sugihara ,Approximation of Voronoi diagrams for figures and its improvement[J]. Department of Mathematical Engineering and Information Physics, Graduate School of Engineering, University of Yokyo,1996.
  • 7[4]Voronoi G. ,Nouvelles applications des parameters continues a la theorie des formes quadratiques; Deuxieme memoire: Recherches sur les parplleloedres primitives[J]. Math, 1908,134:198 ~ 287.
  • 8[5]Lee D. T. and Schachter B. J., Two algorithms for constructing a Delaunay triangulation [J]. International Journal of Computer and Information Sciences, 19o0,9:709 ~ 720.
  • 9[6]Ohya T. Iri M. and Murota K., Improvement of the incremental method for the Voronoi diagram with computational comparison of various algorithms[J].Joumal of the Operations Research Society of Japan, 1984,27:306 ~336.
  • 10赵晔,张有会,赵志辉.Power图的离散生成[J].计算机辅助设计与图形学学报,2003,15(9):1181-1184. 被引量:7

共引文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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