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 : bcell2d_voronoi_impl2d< C, V > , bcell2d< C, V >
• n_iterator : igraph
• n_neighbors : bcell2d< C, V > , bcell3d< C, V >
• N_W : octree_node< Object, CELL >
• nb : Width
• nb_intersect() : bcell2d< C, V > , bcell2d_intersection< C, V > , bcell2d_list< C, V > , bcell2d_voronoi_diagram< C, V > , bcell2d_voronoi_impl2d< C, V > , bcell2d_voronoi_impl_diagram< C, V >
• nbcurves : dsearch< C, V >
• nbe() : edge_set< C, V > , Graph< T > , graphic< C, V > , mesh3d< C, V > , mesher3d_algebraic_curve< C, V > , tpl3d< C, V >
• nbeq() : bcell3d_algebraic_curve< C, V >
• nbequation() : algebraic_set< C, V >
• nbf() : graphic< C, V > , mesh3d< C, V > , mesher3d_algebraic_curve< C, V > , tpl3d< C, V >
• nbineq() : semialgebraic_set< K >
• nbpoints : dsearch< C, V >
• nbv() : graphic< C, V > , mesh3d< C, V > , mesher3d_algebraic_curve< C, V > , point_set< C, N, V > , tpl3d< C, V > , Graph< T >
• ncols() : sample< C, V >
• neighbor() : bcell2d< C, V > , bcell2d_intersection< C, V > , bcell2d_list< C, V > , bcell2d_voronoi_diagram< C, V > , bcell2d_voronoi_impl_diagram< C, V >
• neighbors() : bcell2d< C, V > , bcell3d< C, V > , Graph< T > , igraph
• nend() : Qsc_curve< K > , Rsc_curve< K > , Piecewise_Qsc_curve< K >
• new_point() : box_face< C, V > , solver_implicit< C, V >
• next : mark_t , Graph< T > , GraphDfsIter< T > , dim_cmp< DPoint >
• nface() : point< C, N, with_idx< V > > , vertex< C, N, V >
• nmarks() : lsegment< C, V >
• nmiddle() : Qsc_curve< K > , Rsc_curve< K >
• Node : dualize< C, V, Cell > , graph , graph< Cell > , kdtree_cell< CELL > , mesher2d< C, V > , mesher3d_algebraic_curve< C, V > , voronoi2d< C, V >
• node() : node< _CELL >
• Node : semialgebraic2d< C, V > , subdivision< C, with_tpl3d< V >, CELL >
• node() : node< _CELL >
• Node : voronoi2dimpl< C, V >
• node() : node< _CELL >
• Node : mesher3d_shape< C, V >
• node() : node< _CELL >
• Node : subdivision< C, V, Cell > , bcell< C, with_node< V > > , arrangement2d< C, V >
• NODE_TYPE : node< _CELL > , octree_node< Object, CELL >
• nodes : igraph
• norm() : point< C, N, V >
• normal() : rational_surface< C, N, V > , Bezier_curve< K > , rational_surface< C, N, V >
• normal_vector() : normal_vector< K >
• 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 >
• npoints() : Bezier_curve< K >
• nrows() : sample< C, V >
• nset_t : igraph
• nstart() : Qsc_curve< K > , Rsc_curve< K > , Piecewise_Qsc_curve< K >
• number() : bspline_curve< K >
• numberU() : bspline_surface
• numberV() : bspline_surface
• numer() : Rsc_curve< K >
• numerator() : rational_surface< C, N, V > , rational_curve< C, V >