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.
Type de document :
Rapport
[Intern report] A00-R-429 || everett00b, 2000
Liste complète des métadonnées

https://hal.inria.fr/inria-00099260
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:52:13
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

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

Partager

Métriques

Consultations de la notice

110