 Contents | Geometric Graph Toolbox |
| addFace | ADDFACE add a (square) face defined from its vertices to a graph. |
| boundaryGraph | BOUNDARYGRAPH get boundary of image as a graph |
| boundedVoronoi2d | BOUNDEDVORONOI2D return the voronoi diagram as a graph structure |
| centroidalVoronoi2d | CENTROIDALVORONOI2D create a Centroidal Voronoi Tesselation |
| cleanGraph | CLEANGRAPH return a 'cleaned' graph. |
| clipGraph | CLIPGRAPH clip a graph with a rectangular area |
| cvtIterate | CVTITERATE update germs of a CVT using random points with given density |
| cvtUpdate | CVTUPDATE update germs of a CVT with given points |
| detectePoints | DETECTEPOINTS detect triple points in a binary image |
| detectePoints2 | DETECTEPOINTS2 detect triple points of boundary in a labeled image |
| drawDigraph | DRAWDIGRAPH draw a directed graph, given as a set of vertices and edges |
| drawDirectedEdges | DRAWDIRECTEDEDGES draw edges with arrow indicating direction |
| drawEdgeLabels | DRAWEDGELABELS draw values associated to graph edges |
| drawGraph | DRAWGRAPH draw a graph, given as a set of vertices and edges |
| drawGraphEdges | DRAWGRAPHEDGES draw edges of a graph |
| drawGraphFaces | DRAWGRAPHFACES draw faces of a graph |
| drawNodeLabels | DRAWNODELABELS draw values associated to graph nodes |
| drawSquareMesh | DRAWSQUAREMESH transform 3D graph (mesh) into patch |
| euclideanMST | EUCLIDEANMST build euclidean minimal spanning tree of a set of points |
| findPoint | FINDPOINT find index of a point in an array from its coordinates |
| gcontour2d | GCONTOUR2D creates contour graph of a 2D binary image. |
| gcontour3d | GCONTOUR3D creates contour graph of a 3D binary image. |
| getGraphFace | GETGRAPHFACE return face of a graph as a 2D or 3D polygon |
| getNeighbourEdges | GETNEIGHBOUREDGES find edges adjacent to a given node |
| getNeighbourNodes | GETNEIGHBOURNODES find nodes adjacent to a given node |
| getNodeDegree | GETNODEDEGREE return degree of a node in a (undirected) graph |
| getNodeInnerDegree | GETNODEINNERDEGREE return inner degree of a node in a graph |
| getNodeOuterDegree | GETNODEOUTERDEGREE return outer degree of a node in a graph |
| grClose | GRCLOSE morphological closing on graph |
| grDilate | GRDILATE morphological dilation on graph |
| grErode | GRERODE morphological erosion on graph |
| grLabel | GRLABEL associate a label to each connected component of the graph |
| grMean | GRMEAN compute mean from neihgbours |
| grMedian | GRMEDIAN compute median from neihgbours |
| grOpen | GROPEN morphological opening on graph |
| graph2Contours | GRAPH2CONTOURS convert a graph to a set of contour curves |
| graphStructure | GRAPHSTRUCTURE create a graph structure from nodes, edges... arrays |
| imageGraph | IMAGEGRAPH create equivalent graph of the image |
| knnGraph | KNNGRAPH Create the k-nearest neighbors graph of a set of points |
| mergeGraphs | MERGEGRAPHS merge two graphs, by adding nodes, edges and faces lists. |
| mergeNodes | MERGENODES merge two (or more) nodes in a graph. |
| mergeNodesMedian | MERGENODESMEDIAN merge nodes in a graph |
| minGraph | MINGRAPH merge all edges between 2-degrees nodes. |
| patchGraph | PATCHGRAPH transform 3D graph (mesh) into patch |
| prim | PRIM minimal spanning tree by Prim's algorithm |
| removeDoubleEdges | REMOVEDOUBLEEDGES remove edges sharing two same extremities |
| removeEdge | REMOVEEDGE remove an edge in a graph. |
| removeEdges | REMOVEEDGES remove several edges from a graph |
| removeMultiplePoints | REMOVEMULTIPLEPOINTS remove special triangle configurations in a graph |
| removeNode | REMOVENODE remove a node in a graph, and return the modified graph |
| removeNodes | REMOVENODES remove some nodes in a graph, and return the modified graph |
| simplifyGraph | SIMPLIFYGRAPH simplify graph by removing multiple vertices |
| simplifyLines | SIMPLIFYLINES replace each path between n-points by a single edge |
| vectorize | VECTORIZE transform a binary skeleton into a graph (nodes and edges) |
| voronoi2d | VORONOI2D return the voronoi diagram as a graph structure |
Master index