Here is a list of all class members with links to the classes they belong to:

- n -

• N : octree_node< Object, CELL >
• N_E : octree_node< Object, CELL >
• n_intersections : cell2d< C, V >
• n_iterator : igraph
• n_neighbors : cell2d< C, V > , cell3d< C, V >
• N_W : octree_node< Object, CELL >
• nb : Width
• nb_intersect() : cell2d< C, V > , cell2d_intersection< C, V > , cell2d_list< C, V > , cell2d_voronoi_diagram< C, V >
• nbcurves : dsearch
• nbe() : mesher3d_curve_algebraic< C, V > , topology2d< C, V > , tpl3d< C, V > , edge_set< C, V > , Graph< T >
• nbeq() : cell3d_algebraic_curve< C, V >
• nbequation() : algebraic_set< C, V >
• nbf() : mesher3d_curve_algebraic< C, V > , tpl3d< C, V >
• nbi : graphic< C, V >
• nbineq() : semialgebraic_set< K >
• nbpoints : dsearch
• nbv : graphic< C, V > , Graph< T > , mesher3d_curve_algebraic< C, V > , point_set< C, V > , topology2d< C, V > , tpl3d< C, V >
• ncols() : sample
• neighbor() : cell2d< C, V > , cell2d_intersection< C, V > , cell2d_list< C, V > , cell2d_voronoi_diagram< C, V >
• neighbors() : cell2d< C, V > , cell3d< C, V > , Graph< T > , igraph
• new_point() : box_face< C, V > , solver_implicit< C, V >
• next() : dim_cmp< DPoint > , mark_t , Graph< T > , GraphDfsIter< T >
• nface() : point< C, with_idx< V >, N > , vertex< C, V, N >
• nmarks() : lsegment
• Node : dualize< C, V, Shape, Cell >
• node() : node< _Object, _CELL >
• Node : kdtree_cell< Object, CELL > , subdivision< C, V, Shape, Cell > , graph_dual< Shape, Cell > , semialgebraic2d< C, V >
• node() : node< _Object, _CELL >
• Node : cell< C, with_node< V > > , topology2d< C, V > , arrangement2d< C, V > , voronoi2d< C, V > , mesher3d_curve_algebraic< C, V > , mesher3d_shape< C, V > , subdivision< C, with_tpl3d< V >, SURFACE, CELL >
• NODE_TYPE : octree_node< Object, CELL > , node< _Object, _CELL >
• nodes : igraph
• normals : graphic< C, V >
• north_back_edge : solver_implicit< C, V >
• north_east_edge : solver_implicit< C, V >
• north_edge : solver_implicit< C, V >
• north_face : solver_implicit< C, V >
• north_front_edge : solver_implicit< C, V >
• north_west_edge : solver_implicit< C, V >
• not_on() : face< C, V, POINT >
• nrows() : sample
• nset_t : igraph
• number() : bspline_curve< K >
• numberU() : surface_bspline
• numberV() : surface_bspline
• numerator() : curve_rational< C, V > , surface_rational< K, N >