| 词条 | Nef polygon |
| 释义 |
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.[4] 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.[5] 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.[6]TerminologyIn 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 'segment' 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'. ImplementationsThe 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. See also
References1. ^http://math.ch/archive/documents/WalterNef.pdf 2. ^{{cite book | last = Nef | first = W. | authorlink = Walter Nef | year = 1978 | title = Beiträge zur Theorie der Polyeder | publisher = Herbert Lang | location = Bern }} 3. ^{{Cite book | last = Bieri | first = H. | journal = | year = 1995 | volume = 10 | pages = 43–60 |doi=10.1007/978-3-7091-7584-2_3| title = Geometric Modelling | series = Computing Supplement | isbn = 978-3-211-82666-9 | chapter = Nef Polyhedra: A Brief Introduction }} 4. ^{{cite web | url = http://www.cgal.org/Manual/latest/doc_html/cgal_manual/packages.html#part_VI | title = 2D Boolean Operations on Nef Polygons | work = the CGAL package overview }} 5. ^{{cite paper | citeseerx = 10.1.1.89.6020 | title = AutoCAD Nef Polyhedron Implementation | first = Jeremy | last = Tammik | year = 2007 }} 6. ^{{cite conference | title = Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments | first1 = Peter | last1 = Hachenberger | first2 = Lutz | last2 = Kettner | booktitle = Proc. of 2005 ACM Symposium on Solid and Physical Modeling | conference = SPM | location = Boston, MA. |date=June 2005 }} }} 2 : Polygons|Polyhedra |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。