کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
414799 681044 2012 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Competing output-sensitive frame algorithms
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Competing output-sensitive frame algorithms
چکیده انگلیسی

Two output-sensitive procedures for identifying the extreme points (the “frame”) of the convex hull of a finite point set have appeared in the literature: one by Dulá and Helgason (1996) [10] and the other by Ottmann et al. (2001) [27]. The two procedures are in dual spaces and differ enough to motivate the question as to how they compare in a fair competition. We derive an improved dualized version of the procedure in Ottmann et al. (2001) [27] and compare it to the one in Dulá and Helgason (1996) [10] using a well-structured, large-scale, problem suite.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computational Geometry - Volume 45, Issue 4, May 2012, Pages 186–197
نویسندگان
, ,