Clear Unit-Distance Graphs

Marc van Kreveld; Maarten Löffler; Frank Staals

Clear Unit-Distance Graphs

Marc van Kreveld, Maarten Löffler, Frank 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	English
Title of host publication	EuroCG 2013
Subtitle of host publication	The 29th European Workshop on Computational Geometry: March 17-20, 2013, Braunschweig, Germany
Pages	213-216
Number of pages	4
Publication status	Published - 2013

Keywords

CG, GRAPH, GD

Access to Document

13Final published version, 478 KB

Cite this

@inproceedings{f892fe7037554d06b2ff3bdcc51774df,

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.",

keywords = "CG, GRAPH, GD",

author = "{van Kreveld}, Marc and Maarten L{\"o}ffler and Frank Staals",

year = "2013",

language = "English",

pages = "213--216",

booktitle = "EuroCG 2013",

}

TY - GEN

T1 - Clear Unit-Distance Graphs

AU - van Kreveld, Marc

AU - Löffler, Maarten

AU - Staals, Frank

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.

KW - CG, GRAPH, GD

M3 - Conference contribution

SP - 213

EP - 216

BT - EuroCG 2013

ER -

Clear Unit-Distance Graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this