Nef polygon
来源:互联网 发布:魔方矩阵算法 编辑:程序博客网 时间:2024/05/01 16:49
Nef polygons and Nef polyhedra are the sets of polygons (resp. polyhedra) which can be obtained from a finite set of halfplanes (halfspaces) by Boolean operations of set intersection and set complement. The objects are named after the Swiss mathematician Walter Nef (1919–), who introduced them in his 1978 book on polyhedra.[1][2]
Since other Boolean operations, such as union or difference, may be expressed via intersection and complement operations, the sets of Nef polygons (polyhedra) are closed with respect to these operations as well.[3]
In addition, the class of Nef polyhedra is closed with respect to the topological operations of taking closure, interior, exterior, and boundary. Boolean operations, such as difference or intersection, may produce non-regular sets. However the class of Nef polyhedra is also closed with respect to the operation of regularization.[4]
Convex polytopes are a special subclass of Nef polyhedra, being the set of polyhedra which are the intersections of a finite set of half-planes.[5]
Faces
In the language of Nef polyhedra you can refer to various objects as 'faces' with different dimensions. What would normally be called a 'corner' or 'vertex' of a shape is called a 'face' with dimension of 0. An 'edge' or 'line' is a face with dimension 1. A flat shape in 3d space, like a triangle, is called a face with dimension 2 - or a 'facet'. A shape in 3d space, like a cube, is called a face with dimension 3 - or a 'volume'.[6]
Implementation in a computer
The Computational Geometry Algorithms Library, or CGAL, represents Nef Polyhedra by using two main data structures. The first is a 'Sphere map' and the second is a 'Selective Nef Complex' (or SNC). The 'sphere map' stores information about the polyhedron by creating an imaginary sphere around each vertex, and painting it with various points and lines representing how the polyhedron divides space. The SNC basically stores and organizes the sphere maps. Each face contains a 'label' or 'mark' telling whether it is part of the object or not.[6]
[edit]See also
- CGAL
[edit]References
- ^ Nef, W. (1978). Beiträge zur Theorie der Polyeder. Bern: Herbert Lang.
- ^ Bieri, H. (1995). "Nef polyhedra: A brief introduction". Computational Suppl. 10: 43–60.
- ^ "2D Boolean Operations on Nef Polygons". the CGAL package overview.
- ^ Tammik, Jeremy (2007). AutoCAD Nef Polyhedron Implementation. CiteSeerX: 10.1.1.89.6020.
- ^ Hachenberger, Peter; Kettner, Lutz (June 2005). "Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments". Proc. of 2005 ACM Symposium on Solid and Physical Modeling. SPM. Boston, MA..
- ^ a b Hachenberger, Peter; Kettner, Lutz; Mehlhorn, Kurt. Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments. Saarbrücken, Germany: Max Planck Institut Informatik. CiteSeerX:10.1.1.73.157.
- Polygons
- Polyhedra
- Nef polygon
- polygon
- Polygon
- NEF格式文件转换为JPG格式
- 如何将NEF格式文件转换为JPG格式
- Polygon建模
- Polygon(二)
- Polygon (p1179)
- poj1179 Polygon
- HDU4752 Polygon
- HDU4752 Polygon
- poj_2007_Scrambled Polygon
- Polygon Division
- poj1179 Polygon
- UVA11971 - Polygon
- Farey Polygon
- POJ2007Scrambled Polygon
- UVA11971 - Polygon
- 小米盈利模式
- int main(int argc, char **argv)中两个参考的用法
- WinMain函数浅析
- 用SQL语句,删除掉重复项只保留一条
- 输出2-1000以内的所有完数
- Nef polygon
- 宏定义的使用
- Ext中使用ajax请求成功后信息的处理和tabpanel的刷新
- js实现日期选择器
- Android源码目录结构
- 在数学的海洋中飘荡
- String CF 128B 第k大子串
- 最大公约数问题【微软亚洲研究院“智慧碰撞”中收集】
- Linux常用命令