Search Results for "vertex"
Sort By:
Showing 12 open source projects for "vertex"
View related business solutions-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
Descend
Program for drawing 3D surfaces from parametric equations
Descend is an open source program for drawing 3D surfaces from parametric equations. It uses a custom, very fast language called Misc to calculate the geometry. It also uses OpenGL to render scenes with high quality shaders. Website: https://descend.mimec.org/ -
2
ViennaGrid is a generic mesh handling library that provides the traversal of structured and unstructured grids in arbitrary spatial dimensions, in particular 1d, 2d and 3d. Quantities can be conveniently stored on mesh elements using ViennaData.
-
3
ANGEL-Automatic differentiation Nested Graph Elimination Library is a template library using the Boost Graph Library and the Standard C++ Library; it provides sparse representations of c-graphs their dual line graphs and vertex, edge and face elimina
-
4
Polyhedra-in-MATLAB/Octave
Library for working with polyhedra
Allows user to convert from vertex to facet description and vice versa, convex union of two polyhedra, intercestion of two polyhedra, remove redundant vertices or inequalities from vertex or facet description. -
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
5
A 2-D inviscid flow and adjoint solver on unstructured triangular grids. It makes use of a vertex-centroid finite volume scheme which is second order accurate. The adjoint solver is developed using the automatic differentiation tool called TAPENADE. Code has been moved to https://github.com/cpraveen/euler2d
-
6
An efficient and easy-to-use C++ library containing classes to represent and manipulate graphs and digraphs. Additional vertex and edge/arc property structures are provided that can be synchronized with the graph structure dynamically.
-
7
hgboost is a header-only library which contains a generic hypergraph implementation and provides vertex/node contraction and vertex/edge filtering. It contains algorithms to compute cohesive subgroups, minimum cuts and maximum flows.
-
8
x86mph is an optimized library with vector, matrix, and vertex helpers (including an own TnL) It also contains memory helpers, and other stuff such as image processing (color inverting, changing bpp) taking advantage of x86's 3DNow!, MMX, and SSE
-
9
FFFF is the fastest Win32/OSX/Linux/IRIX Mandelbrot generator. Features OpenGL, realtime zoom, SSE/AltiVec QuadPixel, SSE2/3DNow! DualPixel calc, FPU per pixel calc, GPU asm (Fragment/Vertex) calc, multiprocessor support, and benchmarking. Opt asm code!
-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
10
6Vertex is an Objective C/Cocoa application (and standard C functions) for computing and visualizing matrix models generated with the 6-vertex model for computing boundary shapes and phase transition shapes for differently weighted vertices.
-
11
...This problem of the graph theory consists in finding a negative stream on the arcs which minimizes the total cost of the transport in a network R(V,E,b,c) where : - V = vertex - E
-
12
...Usefulness is primarily in graph theory, also for some computer science problems. Test for preservation of adjacency in a graph over various functions. Sample graphs included, or enter your own edge and vertex sets.
- Previous
- You're on page 1
- Next
