Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00099260
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:52:13 AM
Last modification on : Friday, February 26, 2021 - 3:28:04 PM

Identifiers

  • HAL Id : inria-00099260, version 1

Collections

Citation

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

Share

Metrics

Record views

125