Geometric Representation of Graphs

图的几何表示

• 批准号: RGPIN-2016-03856
• 负责人: Evans, William
• 金额: $ 1.6万
• 依托单位: University of British Columbia
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2016
• 资助国家: 加拿大
• 起止时间: 2016-01-01 至 2017-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=614673
• 关键词: Geometric; Representation; Graphs

This proposal outlines a plan to explore properties of graphs that are defined geometrically. Such graphs arise, for example, in the study of transportation, communication, and sensor networks. The focus of the proposed research is on graphs defined by some notion of contact or visibility between geometric objects. Two objects are mutually visible if there exists a line segment connecting them that does not intersect another object. They are in contact if their boundaries, but not their interiors, intersect. A main theme of the proposed research concerns simultaneous representation, where one set of objects can define more than one graph. By considering contact or visibility between objects in a limited number of directions, we obtain a limited number of different contact or visibility graphs on those objects. My goal is to understand properties of these sets of simultaneously representable graphs and to design algorithms to find such representations. The most commonly studied example of simultaneous representation is the problem of finding a planar drawing of each of two graphs where each vertex is the same point in both drawings (and edges are curves that connect their endpoints). The problem is important, beyond its theoretical interest, for its application to the visual analysis of a changing network on a common set of vertices. While point/curve simultaneous representation has received a great deal of attention, the study of alternative simultaneous representations has been much more limited. I propose to study simultaneous representation using geometric objects, such as segments, rectangles, and disks, as vertices where visibility or contact determines adjacency. For example, rectangles in the plane define one graph when visibility is vertical and another when visibility is horizontal. What pairs of graphs can be represented in this fashion? Given two graphs, what is the complexity of finding such a representation if it exists? Can the existence of such a representation aid in the solving of problems restricted to these graphs? The kinds of graphs that can be represented implicitly using visibility changes depending on the type of object and on the notion of visibility. Part of this proposed research considers visibility representations that allow some amount of "X-ray vision", that is, two objects are mutually k-visible if there is a segment connecting them that intersects at most k other objects. Such graphs arise, for example, when considering networks of sensors that can penetrate a limited number of walls. The model increases the set of graphs that can be represented beyond traditional 0-visibility representations, but in a way that is limited by the geometry of the representation. An objective of the proposed research is to understand to what extent permitting k-visibility impacts the class of representable graphs and to relate this class to other well-known graph classes.

这个提议概述了一个探索几何定义的图的性质的计划。例如，在交通运输、通信和传感器网络的研究中，会出现这样的图。所提出的研究重点是由几何对象之间的一些接触或可见性概念定义的图。如果存在一条线段连接两个对象，且不与另一个对象相交，则两个对象是相互可见的。如果它们的边界相交，而不是它们的内部相交，它们就会接触。提出的研究的一个主题是同时表示，其中一组对象可以定义多个图。通过考虑有限数量方向上的物体之间的接触或可见性，我们得到了这些物体上有限数量的不同接触或可见性图。我的目标是理解这些可同时表示的图的属性，并设计算法来找到这样的表示。