Construct and return the discrete gradient matrix G using some edge and vertex information
Construct and return the discrete gradient matrix G using some edge and vertex information. We assume that edge_vertex lists the edge vertices consecutively, and that the orientation of edge i depends only on the sign of edge_vertex[2*i+1] - edge_vertex[2*i].
alphabetic index hierarchy of classes
generated by doc++