Education-driven research in CAD

We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals.     

Optimum sweeps of simple polygons with two guards

A polygon P admits a sweep if two mobile guards can detect an unpredictable, moving target inside P  , no matter how fast the target moves. Two guards move on the polygon boundary and are required to always be mutually visible. The objective of this study is to find an optimum sweep such that the sum of the distances travelled by the two guards in the sweep is minimized. We present an O(n²)$O(n^2)$ time and O(n)$O(n)$ space algorithm for optimizing this metric, where n   is the number of vertices of the given polygon. Our result is obtained by reducing this problem to finding a shortest path between two nodes in a graph of size O(n)$O(n)$.     

基于Loop细分算法的人体模型网格平滑

网格平滑是实现三维模型离散造型的主要方法。为了实现数字人体几何模型的光顺效果,本文提出一种基于Loop细分算法的三维人体模型的网格平滑方法。细分曲面是用低分辨率的控制网格和定义在控制网格上的一种细分规则来表示曲面的,它能有效改善三维人体几何模型的表面不光滑以及分辨率低的缺点。实验证明,该方法对基于参数化建模方法的、多曲率网格人体模型取得了很好的效果,实现简单高效,特征保持效果也很好。     

基于平行截面上轮廓之间重构问题的研究

研究了基于平行截面上两多边形轮廓重构的基本问题,给出了利用体积最大化作为度量标准来求得一个"较好"并且合法的重构的目标函数,然后得出:其中一个多边形轮廓在其所在的截面上沿着法向平移、在截面内平移和在截面内等比例缩放都不影响最大化体积后的结果。该结论对于三维实体的可视化和几何造型领域具有重要的实用价值。     

多边形叠置分析算法研究

在二维GIS系统中经常需要对图层中的多边形进行叠置分析,为了有效地分析不同系统提供的多边形图层数据,论文研究了地理信息系统中表示多边形图层的两种数据结构——简单数据结构和拓扑数据结构,以及分别适用于这两种情况的多边形叠置算法。拓扑数据结构下的算法现在已经很成熟,论文重点介绍简单数据结构情况下的算法。     

任意多边形坡屋面屋脊线生成方法

坡屋面是一种常见的屋面形式,建筑屋面由于排水以及建筑立面美观的需要,往往将屋面做成坡屋面。目前,市场上的BIM软件出于商业价值的考虑,都对软件的坡屋面生成方法进行严格保密。本文提出了一种生成任意多边形坡屋面屋脊线的方法,该方法可为我们在开发相关BIM软件生成任意坡屋面的功能时候提供重要参考。     

一个多边形快速等距偏移方法

多边形的等距偏移是CAD/CAM领域中的一个基础性问题 ,是型腔环切加工刀具轨迹生成的关键。根据无效环在原始多边形上的对应连续线段必有一凸或凹点 ,从多边形的凸点和干涉凹点出发 ,利用干涉边的连贯性逐步确定无效环 ,最后对多边形中的非干涉区域作等距偏移 ,实现多边形的等距偏移。该方法利用干涉区域的连贯性避免了大量不必要的求交计算 ,同时支持带有孤岛的多边形等距偏移。其算法复杂度接近于O(n) ,其中n为多边形顶点个数。     

基于圆形窗口的简单多边形裁剪算法

提出了一种新颖而实用的圆形窗口Ｖ对多边形Ｐ的裁剪算法。它将多边形Ｐ的边视为有向线段，通过引入多边形顶点的入边和出边交点的概念，深入研究了Ｐ被Ｖ裁剪后的区域确定问题，给出了作出Ｐ在Ｖ内部分的定理