[文集] [专题] [检索] [独立评论] [海阔天空] [矛盾江湖] [全版论坛]

独立评论

所跟帖: 脗陆脝脽 驴麓驴麓脮芒脕陆赂枚露脿脙忙脤氓   2023-04-09 02:49:28  


作者: 脝陆脮媒   脗陆脨脰脌梅潞娄隆拢脝盲脢碌脫脨鹿脴 2023-04-09 03:18:50  [点击:858]
凸多面体的体积问题,前人早有研究:

https://en.wikipedia.org/wiki/Convex_polytope

摘录一段:

Volume computation
The task of computing the volume of a convex polytope has been studied in the field of computational geometry. The volume can be computed approximately, for instance, using the convex volume approximation technique, when having access to a membership oracle. As for exact computation, one obstacle is that, when given a representation of the convex polytope as an equation system of linear inequalities, the volume of the polytope may have a bit-length which is not polynomial in this representation.[14]

加跟贴

笔名:     新网友请先注册笔名 密码:
主题: 进文集
内容: