HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:52:13 AM
Last modification on : Friday, February 4, 2022 - 3:22:34 AM


  • 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⟩



Record views