Geometric Problems in Graphics, Databases and Networking

图形、数据库和网络中的几何问题

• 批准号: 9901958
• 负责人: Subhash Suri
• 金额: $ 21.01万
• 依托单位: Washington University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1999
• 资助国家: 美国
• 起止时间: 1999-09-01 至 2000-10-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9901958&HistoricalAwards=false
• 关键词: Geometric; Problems; Graphics; Databases; Networking

Geometric problems arise in many different disciplines. In some areas, such as computer graphics, which inherently deal with geometric shapes, geometric problems of computational and combinatorial kind are fairly natural. In other areas, such as networking, geometric formulations or methods are rarely employed. Nevertheless, some networking problems of recent interest can be cast quite naturally in geometric terms, and addressed using computational geometry methods. This project identifies some important problems in graphics, databases, and networking that can benefit from computational geometry methodology. These problems include shape and distribution-sensitive geometric algorithms for graphics, multi-attribute histograms in databases, and study of multi-dimensional packet filters in high-speed networks.

几何问题出现在许多不同的学科中。在某些领域，如计算机图形学，其本质上处理几何形状，计算和组合类型的几何问题是相当自然的。在其他领域，例如网络，很少使用几何公式或方法。尽管如此，最近人们感兴趣的一些网络问题可以很自然地用几何术语来表达，并使用计算几何方法来解决。本项目确定了图形、数据库和网络中的一些重要问题，这些问题可以从计算几何方法中受益。这些问题包括图形的形状和分布敏感几何算法，数据库中的多属性直方图，以及高速网络中多维包过滤器的研究。