کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4649426 | 1342454 | 2009 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Constrained graph layout by stress majorization and gradient projection
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
The adoption of the stress-majorization method from multi-dimensional scaling into graph layout has provided an improved mathematical basis and better convergence properties for so-called “force-directed placement” techniques. In this paper we explore algorithms for augmenting such stress-majorization techniques with simple linear constraints using gradient-projection optimization techniques. Our main focus is a particularly simple class of constraints called “orthogonal-ordering constraints” but we also discuss how gradient-projection methods may be extended to solve more general linear “separation constraints”. In addition, we demonstrate several graph-drawing applications where these types of constraints can be very useful.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 309, Issue 7, 8 April 2009, Pages 1895–1908
Journal: Discrete Mathematics - Volume 309, Issue 7, 8 April 2009, Pages 1895–1908
نویسندگان
Tim Dwyer, Yehuda Koren, Kim Marriott,