/usr/share/octave/packages/geometry-1.7.0/graphs/doc-cache is in octave-geometry 1.7.0-1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 | # Created by Octave 3.8.0, Tue Feb 25 00:00:38 2014 UTC <root@aatxe>
# name: cache
# type: cell
# rows: 3
# columns: 5
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 13
delaunayGraph
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 841
-- Function File: [POINTS EDGES]= delaunayGraph (POINTS)
Graph associated to Delaunay triangulation of input points
Compute the Delaunay triangulation of the set of input points, and
convert to a set of edges. The output NODES is the same as the
input POINTS.
WARNING: 3d pltottig works correctly in Octave >= 3.6
Example
# Draw a planar graph correpspionding to Delaunay triangulation
points = rand(30, 2) * 100;
[nodes edges] = delaunayGraph(points);
figure;
drawGraph(nodes, edges);
# Draw a 3Dgraph corresponding to Delaunay tetrahedrisation
points = rand(20, 3) * 100;
[nodes edges] = delaunayGraph(points);
figure;
drawGraph(nodes, edges);
view(3);
See also: delaunay, delaunayn.
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 58
Graph associated to Delaunay triangulation of input points
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 9
drawGraph
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 1703
-- Function File: drawGraph ( NODES, EDGES)
-- Function File: drawGraph ( NODES, EDGES, FACES)
-- Function File: drawGraph ( GRAPH)
-- Function File: drawGraph ( ..., SNODES)
-- Function File: drawGraph ( ..., SNODES, SEDGES)
-- Function File: drawGraph ( ..., SNODES, SEDGES, SFACES)
-- Function File: H = drawGraph (...)
-- Function File: [H HE] = drawGraph (...)
-- Function File: [H HE HF] = drawGraph (...)
Draw a graph, given as a set of vertices and edges
DRAWGRAPH(NODES, EDGES) draw a graph specified by a set of nodes
(array N*2 or N*3, corresponding to coordinate of each node), and a
set of edges (an array Ne*2, containing for each edge the first and
the second node). Default drawing is a red circle for nodes and a
blue line for edges.
DRAWGRAPH(NODES, EDGES, FACES) also draw faces of the graph as
patches.
DRAWGRAPH(GRAPH) passes argument in a srtucture with at least 2
fields named 'nodes' and 'edges', and possibly one field 'faces',
corresponding to previously described parameters. GRAPH can also
be a cell array, whose first element is node array, second element
is edges array, and third element, if present, is faces array.
DRAWGRAPH(..., SNODES) DRAWGRAPH(..., SNODES, SEDGES)
DRAWGRAPH(..., SNODES, SEDGES, SFACES) specify the draw mode for
each element, as in the classical 'plot' function. To not display
some elements, uses 'none'.
H = DRAWGRAPH(...) return handle to the set of edges.
[HN, HE] = DRAWGRAPH(...) return handle to the set of nodes and to
the set of edges.
[HN, HE, HF] = DRAWGRAPH(...) Also return handle to the set of
faces.
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 50
Draw a graph, given as a set of vertices and edges
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 15
graphs_Contents
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 5101
-- Function File: graphs_Contents ()
GRAPHS Simple Toolbox for manipulating Geometric Graphs Version 0.5
11-Apr-2010 .
The aim of this package is to provides functions to easily create,
modify and display geometric graphs (geometric in a sense position
of vertices is kept in memory).
Graph structure is represented by at least two arrays: * NODES,
which contains coordinates of each vertex * EDGES, which contains
indices of start and end vertex.
Others arrays may sometimes be used: * FACES, which contains
indices of vertices of each face (either a double array, or a cell
array) * CELLS, which contains indices of faces of each cell.
An alternative representation is to use a structure, with fields: *
edges * faces * cells corresponding to the data described above.
Note that topological description of 2D graph is entirely contained
in EDGES array, and that NODES array is used only to display graph
Caution: this type of data structure is easy to create and to
manage, but may be very inefficient for some algorithms.
Graphs are usually considered as non-oriented in this package.
Graph creation knnGraph - Create the k-nearest neighbors graph of a
set of points delaunayGraph - Graph associated to Delaunay
triangulation of input points euclideanMST - Build euclidean
minimal spanning tree of a set of points prim_mst - Minimal
spanning tree by Prim's algorithm
Create graph from images imageGraph - Create equivalent graph of a
binary image boundaryGraph - Get boundary of image as a graph
gcontour2d - Creates contour graph of a 2D binary image.
gcontour3d - Create contour graph of a 3D binary image. vectorize
- Transform a binary skeleton into a graph (nodes and edges)
Graph information grNodeDegree - Degree of a node in a (undirected)
graph grNodeInnerDegree - Inner degree of a node in a graph
grNodeOuterDegree - Outer degree of a node in a graph
grNeighborNodes - Find adjacent nodes of a given node
grNeighborEdges - Find adjacent edges of a given node
grOppositeNode - Return opposite node in an edge grLabel -
Associate a label to each connected component of the graph
Graph management (low level operations) grRemoveNode - Remove a
node in a graph grRemoveNodes - Remove several nodes in a graph
grRemoveEdge - Remove an edge in a graph. grRemoveEdges - Remove
several edges from a graph
Graph processing (general applications) mergeGraphs - Merge two
graphs, by adding nodes, edges and faces lists. grMergeNodes -
Merge two (or more) nodes in a graph. grMergeMultipleNodes -
Simplify a graph by merging multiple nodes grMergeMultipleEdges -
Remove all edges sharing the same extremities grSimplifyBranches -
Replace branches of a graph by single edges
Filtering operations on Graph grMean - Compute mean from neihgbours
grMedian - Compute median from neihgbours grDilate - Morphological
dilation on graph grErode - Morphological erosion on graph grClose
- Morphological closing on graph grOpen - Morphological opening on
graph
Geodesic operations grPropagateDistance - Propagates distances from
a vertex to other vertices grVertexEccentricity - Eccentricity of
vertices in the graph graphDiameter - Diameter of a graph
graphPeripheralVertices - Peripheral vertices of a graph
graphCenter - Center of a graph graphRadius - Radius of a graph
grFindGeodesicPath - Find a geodesic path between two nodes in the
graph grFindMaximalLengthPath - Find a path that maximizes sum of
edge weights
Operations for geometric graphs grMergeNodeClusters - Merge cluster
of connected nodes in a graph grMergeNodesMedian - Replace several
nodes by their median coordinate clipGraph - Clip a graph with a
rectangular area addSquareFace - Add a (square) face defined from
its vertices to a graph grFaceToPolygon - Compute the polygon
corresponding to a graph face graph2Contours - Convert a graph to a
set of contour curves
Voronoi Graphs voronoi2d - Compute a voronoi diagram as a graph
structure boundedVoronoi2d - Return a bounded voronoi diagram as a
graph structure centroidalVoronoi2d - Create a 2D Centroidal
Voronoi Tesselation cvtUpdate - Update germs of a CVT with given
points cvtIterate - Update germs of a CVT using random points with
given density
Graph display drawGraph - Draw a graph, given as a set of vertices
and edges drawGraphEdges - Draw edges of a graph drawGraphFaces -
Draw faces of a graph drawDigraph - Draw a directed graph, given as
a set of vertices and edges drawDirectedEdges - Draw edges with
arrow indicating direction drawEdgeLabels - Draw values associated
to graph edges drawNodeLabels - Draw values associated to graph
nodes drawSquareMesh - Draw a 3D square mesh given as a graph
patchGraph - Transform 3D graph (mesh) into a patch handle
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 80
GRAPHS Simple Toolbox for manipulating Geometric Graphs Version 0.5
11-Apr-2010
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 8
knnGraph
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 253
-- Function File: EDGES = knnGrpah (NODES)
Create the k-nearest neighbors graph of a set of points
EDGES = knnGraph(NODES)
Example
nodes = rand(10, 2);
edges = knnGraph(nodes);
drawGraph(nodes, edges);
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 55
Create the k-nearest neighbors graph of a set of points
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 9
voronoi2d
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 370
-- Function File: [NODES EDGES FACES] = voronoi2d (GERMS)
Compute a voronoi diagram as a graph structure
[NODES EDGES FACES] = voronoi2d(GERMS) GERMS an array of points
with dimension 2 NODES, EDGES, FACES: usual graph representation,
FACES as cell array
Example
[n e f] = voronoi2d(rand(100, 2)*100);
drawGraph(n, e);
# name: <cell-element>
# type: sq_string
# elements: 1
# length: 46
Compute a voronoi diagram as a graph structure
|