Complexity issues in geometric and combinatorial arrangements

几何和组合排列的复杂性问题

• 批准号: 329257-2009
• 负责人: Tardos, Gabor
• 金额: $ 2.55万
• 依托单位: Simon Fraser University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2012
• 资助国家: 加拿大
• 起止时间: 2012-01-01 至 2013-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=503458
• 关键词: Complexity; issues; geometric; combinatorial; arrangements

One major research direction of this proposal is the study of arrangements of simple geometric objects, such as lines, segments, disks, triangles, etc. and find out what makes them simple or complex, when can they avoid certain patterns and answer many similar questions.

该提案的一个主要研究方向是研究简单几何对象的排列，如直线、线段、圆盘、三角形等，并找出是什么使它们简单或复杂，何时它们可以避免某些模式，并回答许多类似的问题。