Distance segment visibility graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2000

Distance segment visibility graphs

C.T. Hoang
  • Function : Author
K. Kilakos
  • Function : Author
M. Noy
  • Function : Author


Given a set of disjoint line segments in the plane, the distance segment visibility graph is the segment visibility graph in which each edge is assigned a weight equal to the Euclidean distance between the corresponding segment endpoints. In this paper we provide a polynomial time recognition algorithm for distance segment visibility graphs.
No file

Dates and versions

inria-00099260 , version 1 (26-09-2006)


  • HAL Id : inria-00099260 , version 1


Hazel Everett, C.T. Hoang, K. Kilakos, M. Noy. Distance segment visibility graphs. [Intern report] A00-R-429 || everett00b, 2000. ⟨inria-00099260⟩
48 View
0 Download


Gmail Facebook Twitter LinkedIn More