Displaying 1 to 20 from 21 results

Cytoscape.js is a fully featured graph theory library. Do you need to model and/or visualise relational data, like biological data or social networks? If so, Cytoscape.js is just what you need. Cytoscape.js contains a graph theory model and an optional renderer to display interactive graphs. This library was designed to make it as easy as possible for programmers and scientists to use graph theory in their apps, whether it's for server-side analysis in a Node.js app or for a rich user interface.

cytoscapejs graph graph-theory network node edge vertex link analysis visualisation visualization draw render biojs cytoscapeConvenience functions for sending vertex data to an attribtue of a THREE.BufferGeometry.This will flatten vertex data if necessary, attempt to re-use arrays where possible to minimize GC, and handle some compatibility issues across different versions of ThreeJS. It can handle dynamically growing and shrinking buffers.

buffer geometry buffergeometry three webgl js threejs three.js data vertex vert vertices dynamic bufferdataA browserify transform that transparently enables live reloading of your shaders when using glslify.You might want to respond to these automatic updates, especially considering that they may result in changing the values of your uniform/attribute variables.

glsl live reload update webgl shader fragment vertex refresh browserify-transformGraph is a mathematical graph library. It is designed to be a functional, stand-alone, light-weight library for general purpose graph processing. Definitions are taken from the Wikipedia glossary of mathematical graph theory. That's a great place to start to get a basic understanding of graph theory. The documentation in this library includes both the Wikipedia definitions and the the implemetation details.

graph graph-theory vertex edge node connectionFinds a maximum bipartite matching in an unweighted graph. The current implementation uses the Hopcroft-Karp algorithm and runs in O(sqrt(V) * E + V) time. Works in both node.js and in a browser.

bipartite graph edge matching vertex assignment problem labelsThis CommonJS module implements basic topological operations and indexing for abstract simplicial complexes (ie graphs, triangular and tetrahedral meshes, etc.) in JavaScript. You probably already know of many examples of simplicial complexes. Triangular meshes (as commonly used in computer graphics) are just 2d simplicial complexes; as are Delaunay triangulations. A more restricted example of a simplicial complex is the notion of a hypergraph, which is basically what you get when you forget the ordering of each cell.

mesh cell complex simplex simplicial topology vertex triangle star edge graph winged halfComputes vertex normals for a mesh using angle weights. This is slower, but produces results which are more robust to the mesh subdivision. Computes vertex normals from for a mesh.

mesh normal simplicial complex angle weight vertex rendering graphicsA robust 2D constrained Delaunay triangulation library written in JavaScript.

constrained delaunay triangulation polygon planar graph vertex geometry cdt 2d triangle edge point robust exact constraint hole loopResolves all self intersections, t-junctions, and removes duplicate vertices/edges from a planar straight line graph using iterated snap rounding. Processes an unoriented planar straight line graph defined by points and edges in place.

planar straight line graph geometry topology polygon snap rounding tjunction crossing junction duplicate vertex edge point cell complex repair clean self intersectionConnectivity queries can be answered in O(log(size of component)), and updates take O(log(number of vertices)^2) time. The total space complexity is O((number of edges + number of vertices) * log(number of vertices)). This code works both in node.js and in the browser using browserify.

dynamic graph connected component forest label spanning tree insert delete remove link cut edge euler vertex pathCalculates vertex based ambient occlusion values for a triangular mesh. Generates an ambient occlusion map for a mesh from the vertices of a mesh.

vertex ambient occlusion meshPull up a chair, and let me tell you a story of the once and future Internet. In the beginning of the Internet, all networking was “peer to peer”. If you were lucky enough to have an Internet-connected computer, you could talk to any other Internet-connected computer; in fact, being able to do so was practically the definition of “Internet connected”.

vertex internet alice bobSuper simple WebGL shader loader plugin for browserify

shader webgl vertex fragment browserify transformAlgorithms in Python Anagram, Bubblesort, Quick, Merge, Binary, Babil, E Number, Fibonacci, Insertion, Golden Ratio, Hamming Numbers, Mersenne Primes, Levenshtein, Perfect Number, Prime Numbers, Sift3, Shell, Tree Node, Vertex, Graph

sort mersenne insertion prime-numbers golden-ratio fibonacci vertex graph algorithmluminance is an effort to make graphics rendering simple and elegant. Feel free to dig in the online documentation here.

shaders luminance gpu opengl tessellation framebuffer texture buffer vertexSparklingGraph provides easy to use set of features that will give you ability to proces large scala graphs using Spark and GraphX. Bartusiak et al. (2017). SparklingGraph: large scale, distributed graph processing made easy. Manuscript in preparation.

graph measure spark machine-learning comunity-detection-methods network-analysis graph-algorithms big-data vertex link-predication heuristics coarsing approximation dslRGL is a framework for graph data structures and algorithms. The design of the library is much influenced by the Boost Graph Library (BGL) which is written in C++. Refer to http://www.boost.org/libs/graph/doc for further links and documentation on graph data structures and algorithms and the design rationales of BGL.

rgl graph-library graph-algorithms directed-graphs dot graph vertex edgesConstructs a wrapped shader object with shims for all of the uniforms and attributes in the program. The optional uniforms and attributes arrays have the following format. This will be extracted at run-time from the shader, so you can typically omit the uniforms and attributes arguments.

webgl shader fragment vertex uniform attribute wrap 3d gl
We have large collection of open source products. Follow the tags from
Tag Cloud >>

Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
**Add Projects.**