A Comparison Between the Efficiency of Ordinary and Supremum-Metric Voronoi Diagrams in Discrete Space

Emami, Damon

لينك‌ها

[ گزارش اشكال در مقاله | بازگشت | جستجو | ليست كنفرانس‌ها ]

اطلاعات مقاله

[ اعتبار مورد نياز: 1 | تعداد صفحات: 7 | 772 بار مشاهده چكيده ]

عنوان مقاله:	A Comparison Between the Efficiency of Ordinary and Supremum-Metric Voronoi Diagrams in Discrete Space
سرفصل مربوط:		سال انتشار:	1389
نوع ارايه:		محل انتشار:	[ سيزدهمين كنفرانس دانشجويي مهندسي برق ايران ]
زبان مقاله:	انگليسي	حجم فايل:	467.18 كيلوبايت

نمايش خلاصه مقاله

A Comparison Between the Efficiency of Ordinary and Supremum-Metric Voronoi Diagrams in Discrete Space Fulltext

نويسنده:

[ Damon Emami ] - Shahrood University of Technology

خلاصه مقاله:

In this paper we scrutinize the considerations of generating voronoi diagrams in discrete spaces and compare the process of extracting two specific kinds of voronoi diagrams in some aspects. One is ordinary voronoi diagram which is defined with the use of Euclidean distance between two points, while the other is supremum-metric voronoi diagram, a derivation of Minkowski-metric voronoi diagram. We show that using supremum-metric voronoi diagram relieves us from a lot of computational complications and helps us to reduce the execution time. Finally we examine the authenticity of the presented discussion with an example.

كلمات كليدي:

Path Planning Problem, Voronoi Diagram, Visibility Graph

[ لينک دايمي به اين صفحه: http://www.civilica.com/Paper-ISCEE13-ISCEE13_221.html ]

نمايش صفحه قابل چاپ خلاصه مقاله