Title of article
On the visibility graph of convex translates Original Research Article
Author/Authors
Kiyoshi Hosono، نويسنده , , Henk Meijer، نويسنده , , David Rappaport، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
16
From page
195
To page
210
Abstract
We show that the visibility graph of a set of non-intersecting translates of the same compact convex object in R2 always contains a Hamiltonian path. Furthermore, we show that every other edge in the Hamiltonian path can be used to obtain a perfect matching that is realized by a set of non-intersecting lines of sight.
Keywords
Computational geometry , Matching , Visibility graph , Hamiltonian path
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885270
Link To Document