Clear Unit-Distance Graphs

M.J. van Kreveld; M. Loeffler; F. Staals

Clear Unit-Distance Graphs

M.J. van Kreveld, M. Loeffler, F. Staals

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

Abstract

We introduce a variation of unit-distance graphs which we call \emph {clear unit-distance graphs}. They require the pairwise distances of the representing points to be either exactly 1 or not close to 1. We discuss properties and applications of clear unit-distance graphs.

Original language	Undefined/Unknown
Title of host publication	Proc. 29th European Workshop on Computational Geometry
Pages	213-216
Number of pages	4
Publication status	Published - 2013

Cite this

@inproceedings{da18c613671a4a8aa355af80432885ea,

title = "Clear Unit-Distance Graphs",

abstract = "We introduce a variation of unit-distance graphs which we call \emph {clear unit-distance graphs}. They require the pairwise distances of the representing points to be either exactly 1 or not close to 1. We discuss properties and applications of clear unit-distance graphs.",

author = "{van Kreveld}, M.J. and M. Loeffler and F. Staals",

note = "kls-cudg-13",

year = "2013",

language = "Undefined/Unknown",

pages = "213--216",

booktitle = "Proc. 29th European Workshop on Computational Geometry",

}

TY - GEN

T1 - Clear Unit-Distance Graphs

AU - van Kreveld, M.J.

AU - Loeffler, M.

AU - Staals, F.

N1 - kls-cudg-13

PY - 2013

Y1 - 2013

N2 - We introduce a variation of unit-distance graphs which we call \emph {clear unit-distance graphs}. They require the pairwise distances of the representing points to be either exactly 1 or not close to 1. We discuss properties and applications of clear unit-distance graphs.

AB - We introduce a variation of unit-distance graphs which we call \emph {clear unit-distance graphs}. They require the pairwise distances of the representing points to be either exactly 1 or not close to 1. We discuss properties and applications of clear unit-distance graphs.

M3 - Conference contribution

SP - 213

EP - 216

BT - Proc. 29th European Workshop on Computational Geometry

ER -