Showing 3 open source projects for "vertex"

View related business solutions
  • Earn up to 16% annual interest with Nexo. Icon
    Earn up to 16% annual interest with Nexo.

    Access competitive interest rates on your digital assets.

    Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
    Get started with Nexo.
  • Veeam Data Platform v13.1 Icon
    Veeam Data Platform v13.1

    Move workloads across hypervisors and clouds with no vendor lock-in. Try VDP free today.

    Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
    Try Now
  • 1
    Synthclipse

    Synthclipse

    GLSL shader prototyping tool based on Eclipse IDE.

    Synthclipse is a GLSL shader prototyping tool. It makes possible to fast develop all kinds of shaders: Fragment (FS), Vertex (VS), Geometry (GS), Tessellation (TS) and Compute (CS). Shader development can be done using, compatible with Fragmentarium and Shadertoy (but limited to FS and VS), Fragx shaders or by using fully featured JavaScript JSX scripts. The JSX API is consistent with WebGL but in fact exposes complete OpenGL 4+ API. To install Synthclipse one can download prepacked Eclipse with Synthclipse feature (see "Files" section above) or update an existing Eclipse using the following Update Site: https://kamil-kolaczynski.github.io/synthclipse/update/ Prepacked version has one advantage: it has nice console logs coloring since it shipped with Grep Console plugin ( https://marketplace.eclipse.org/content/grep-console ) that is configured specially for Synthclipse logs.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    This Eclipse plugin help you to create, edit and verify your GLSL (OpenGL Shading Language) and NVidia CG vertex and pixel shaders directly inside the Eclipse IDE. Each shader can be edit in an editor with syntax color with error/warning markers.
    Downloads: 11 This Week
    Last Update:
    See Project
  • 3

    Exact Subgraph Matching Algorithm

    Exact Subgraph Matching Algorithm for Dependency Graphs

    ...We designed a simple exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach. The total worst-case algorithm complexity is O(n^2 * k^n) where n is the number of vertices and k is the vertex degree. We have demonstrated the successful usage of our algorithm in three biomedical relation and event extraction applications: BioNLP 2011 shared tasks on event extraction, Protein-Residue association detection and Protein-Protein interaction identification. This Java implementation implements our ESM algorithm. See README file: https://sourceforge.net/projects/esmalgorithm/files/ If you use our ESM implementation to support academic research, please cite the following paper: Haibin Liu, Vlado Keselj, and Christian Blouin. ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next