Algorithms in computational geometry and graph drawing

计算几何和绘图中的算法

• 批准号: 36704-2010
• 负责人: Lubiw, Anna
• 金额: $ 3.13万
• 依托单位: University of Waterloo
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2013
• 资助国家: 加拿大
• 起止时间: 2013-01-01 至 2014-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=521423
• 关键词: Algorithms; computational; geometry; graph; drawing

My research is in design and analysis of algorithms -- specifically in the areas of computational geometry and graph algorithms. Graph representations are ubiquitous in computer science, engineering and the sciences -- a few examples are: road/electical/internet networks in engineering, and molecular structures in chemistry and biology. Geometry, sometimes intrinsic, and sometimes imposed, is often a valuable part of a graph representation. A big part of my work is about devising algorithms to find, manipulate and utilize such geometric representations of graphs. Specifically, I propose working on algorithms to represent two graphs that share some vertices and edges, with the constraint that the shared part be represented consistently.

我的研究方向是算法的设计和分析--特别是在计算几何和图形算法领域。图形表示在计算机科学、工程和科学中普遍存在--举几个例子：工程中的道路/电子/互联网网络，以及化学和生物中的分子结构。几何，有时是内在的，有时是强加的，通常是图形表示的一个有价值的部分。我的大部分工作是关于设计算法来发现、操作和利用这种图形的几何表示。具体地说，我建议研究算法来表示共享一些顶点和边的两个图，但约束是共享的部分必须一致表示。