Computational Studies in Polyhedral Convexity: Lattice Points and Triangulations

多面体凸性的计算研究：格点和三角剖分

• 批准号: 0073815
• 负责人: Jesus De Loera
• 金额: $ 7.39万
• 依托单位: University of California-Davis
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2000
• 资助国家: 美国
• 起止时间: 2000-08-01 至 2003-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0073815&HistoricalAwards=false
• 关键词: Computational; Studies; Polyhedral; Convexity; Lattice

De Loera0073815 The investigator studies the combinatorial and algebraic properties of optimal subdivisions, coverings, and triangulations of convex polytopes. He develops algorithms for the computation of such optimal objects. Criteria of optimality that are explored include minimization of the number of simplices, of the total sum of lengths or areas of simplices, and of the average volume of the simplices. He also develops software for counting all lattice points inside a low-dimensional polytope and for computing their integer hulls. The technique also allows the fast computation of volumes. Specific problems are considered to assess efficiency of the software, for example the optimal arrangements of n points, in a sphere of fixed radius, that maximize the number of lattice points inside their convex hull. Algorithms for the software are adaptations of new techniques, due to Barvinok, that are based on covering polyhedra with unimodular simplices. This project also includes methods from convexity, combinatorics, integer and linear programming, commutative algebra, complexity, and intensive computer experimentation. The results of this work should be of interest in integer programming, combinatorics, and symbolic-algebraic computing. Informally speaking, the first part of this project can be thought of as an attempt to understand how to break or decompose objects, such as cubes and polygons, into elementary blocks or pieces efficiently. This is perhaps reminiscent of creating jigsaw puzzles. The blocks used in the decomposition are, for instance, tetrahedra, triangles, or smaller cubes. An example of efficient decomposition is to use the smallest number of pieces. The second part of the project involves establishing practical computer software for counting regularly distributed points within regular boundaries. Examples of regularly distributed points are arrangements of atoms or crystals. Many of the theoretical questions under study are motivated by problems in computer graphics and computer visualization (via the design of economic meshes for modeling figures), data security and computation (in the context of RSA encryption, which is used in internet transactions), and operations research (via certain techniques for solving integer programs when levels of uncertainty are expected). The training of students is an important component of the project.

De Loera0073815研究了凸多面体的最优细分、覆盖和三角剖分的组合和代数性质。他开发了计算这种最优目标的算法。所探讨的最优性标准包括最小化简化的数目、简化的总长度或面积的总和以及简化的平均体积。他还开发了软件，用于计算低维多面体内部的所有格点，并计算它们的整数外壳。该技术还允许快速计算体积。考虑具体问题来评估软件的效率，例如，在固定半径的球面上，最大化其凸壳内的格点数量的n个点的最优布置。该软件的算法是对新技术的改编，由于Barvinok，这些新技术基于用单模单纯形覆盖多面体。这个项目还包括凸性、组合学、整数和线性规划、交换代数、复杂性和密集的计算机实验的方法。这项工作的结果应该对整数规划、组合学和符号代数计算感兴趣。非正式地说，这个项目的第一部分可以被认为是试图了解如何将对象(如立方体和多边形)有效地分解或分解为基本的块或块。这或许让人想起了创造拼图游戏。例如，分解中使用的块是四面体、三角形或更小的立方体。有效分解的一个例子是使用最小数量的碎片。该项目的第二部分涉及建立实用的计算机软件，用于计算规则边界内规则分布的点数。规则分布点的例子是原子或晶体的排列。许多正在研究的理论问题的动机是计算机图形学和计算机可视化(通过为数字建模设计经济网格)、数据安全和计算(在互联网交易中使用RSA加密的背景下)以及运筹学(通过在预期的不确定性水平时解决整数规划的某些技术)。学生的培养是该项目的重要组成部分。