... 模型几何的对应技术 SubDivision surface 求计算几何的书 Computational Geometry in 历史与几何的学员 credits in history and geometry ...
基于10个网页-相关网页
Computational Geometry in C 求计算几何的书
This paper extends the concept of monotone chain in computational geometry. It presents a new polygon scanning fill algorithm, polygon filling algorithm based on monotony chain.
通过扩展计算几何中“单调链”概念，提出了一种新的多边形扫描线填充算法，即基于单调链的扫描线多边形填充算法。
This paper discusses the problem of covering an ordered point set by a sequence of rectangles with minimum width in the area of computational geometry.
讨论了计算几何学中的矩形条覆盖问题，提出解决该问题的一个有效算法，并对提出的算法进行了分析。
Convex hull problem is one of the fundamental problems in computational geometry, and is used in many fields.
凸包问题是计算几何的基本问题之一，在许多领域均有应用。
应用推荐