Distance segment visibility graphs

Hazel Everett (1) , C.T. Hoang , K. Kilakos , M. Noy

1 ISA - Models, algorithms and geometry for computer graphics and vision

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.

Mots clés: visibility computational geometry; visibilité géométrie algorithmique

Domaines: Autre [cs.OH]

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