Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

DCG
2008

favoriteEmaildiscussreport

82views more DCG 2008»

Visibility Graphs of Point Sets in the Plane

13 years 4 months ago

Visibility Graphs of Point Sets in the Plane

Download www.math.uni-rostock.de

The visibility graph V(X) of a discrete point set X R2 has vertex set X and an edge xy for every two points x, y X whenever there is no other point in X on the line segment between x and y. We show that for every graph G, there is a point set X R2 , such that the subgraph of V(X Z2 ) induced by X is isomorphic to G. As a consequence, we show that there are visibility graphs of arbitrary high chromatic number with clique number six settling a question by K

Florian Pfender

Real-time Traffic

DCG 2008 | Discrete Point | Edge Xy | Visibility Graphs |

claim paper

Related Content

» Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint

» MinimumLink Paths Among Obstacles in the Plane

» Embedding Point Sets into Plane Graphs of Small Dilation

» Delaunay graphs of point sets in the plane with respect to axisparallel rectangles

» Computing the visibility graph of points within a polygon

» Bar kVisibility Graphs Bounds on the Number of Edges Chromatic Number and Thickness

» The Number of Triangulations on Planar Point Sets

» Universal Sets of n Points for Onebend Drawings of Planar Graphs with n Vertices

» Universal Sets of n Points for 1Bend Drawings of Planar Graphs with n Vertices

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DCG
Authors	Florian Pfender

Comments (0)