polyhedron do-main

Sets as its aim to obtain an integral representation of the holomorphic functions on the analytic subvariety of strict pseudoconvex polyhedron in space C n.

通过在Ｃｎ空间中强拟凸多面体域的复补维数为ｍ（１≤ｍ＜ｎ）的子流形上构造积分核，得到该复子流上的全纯函数的积分表示公式。

Three algorithms are presented for computing the shortest path between two arbitrary points on a polyhedral surface: One is an approximate algorithm; the other two can obtain the shortest path or an approximately shortest path.

提出计算多面体面上任意两点之间最短路径的算法:近似算法、最短路径或近似最短路径算法。