Search Results for "vertex"

...Analysis tools like Moving Least Squares, mesh morphing and more. Tools to visualize and edit meshes (cutting a mesh with another mesh, slicing, normalizing, moving vertex positions, etc..). Split mesh based on surface connectivity. Extract the largest connected area. Calculate areas, volumes, center of mass, average sizes etc. Calculate vertex and face normals, curvatures, feature edges. Fill mesh holes.

...Simple 2D package and more complex 3D package with Z-buffering. Texture mapping not supported at the moment. Color interpolation for lines, Gouraud shading for polygons fully supported. Floating point vertex coordinates, not integer. Pixel-level aliasing, not endpoint aliasing. Doesn't use Bresenham line style! Works with all Java versions. No external dependencies. Suitable for study in academic institutions, especially as related to line-drawing accuracy. Particular attention to detail concerning chopping of accumulation errors, using a cast from 64 bit to 32 bit strategy, in the interval [1.0,2.0). ...

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/

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.

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

a collection of small and medium-sized simulation programs that I made explicitely for dydactic and/or documentation purposes. Browse the files, don't click on widnload because there are multiple zips!! All are related to rigidbody dynamics used to make vehicle simulators in the simplest way. Other types of programs may figure too: Snake or Tetris in C for showing the C programming style opted for the other, more specific programs. Possibly this is a link for supplying material to some...

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.

Free Organic Chemistry Analysis and Visualisation Tool; Chemical formula editor, calculation of threedimensional molecular structures, high-quality realtime rendering, ...

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

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.

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

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!

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.

...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