This paper studies weak proximity drawings of graphs and demonstrates their advantages over strong proximity drawings in certain cases. Weak proximity drawings are straight line drawings such that if the proximity region of two points p and q representing vertices is devoid of other points representing vertices, then segment (p,q) is allowed, but not forced, to appear in the drawing. This differs from the usual, strong, notion of proximity drawing in which such segments must appear in the drawing. -

DI BATTISTA, G., Giuseppe, L., SUE H., W. (2006). The strength of weak proximity. JOURNAL OF DISCRETE ALGORITHMS, 4, 384-400 [10.1016/j.jda.2005.12.004].

The strength of weak proximity

DI BATTISTA, Giuseppe;
2006-01-01

Abstract

This paper studies weak proximity drawings of graphs and demonstrates their advantages over strong proximity drawings in certain cases. Weak proximity drawings are straight line drawings such that if the proximity region of two points p and q representing vertices is devoid of other points representing vertices, then segment (p,q) is allowed, but not forced, to appear in the drawing. This differs from the usual, strong, notion of proximity drawing in which such segments must appear in the drawing. -
2006
DI BATTISTA, G., Giuseppe, L., SUE H., W. (2006). The strength of weak proximity. JOURNAL OF DISCRETE ALGORITHMS, 4, 384-400 [10.1016/j.jda.2005.12.004].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11590/149058
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? ND
social impact