Upstream software project

v-hacd

Development files for V-HACD

About v-hacd

Development files for V-HACD

This project links 4 native package records across 2 recorded operating-system releases. Compare the retained versions and architectures below, then open the package for your own release.

These are catalog observations, not a guarantee of installation, compatibility, or upstream support.

Project pictures and package coverage

v-hacd repository preview from GitHub
Project repository preview, supplied by GitHub. Open source repository
Fedora 43: 2 package records; Fedora 44: 2 package records. Catalog coverage diagram, not an application screenshot.v-hacd: recorded package coverageFedora 432 recordsFedora 442 records
OpenFactory diagram of linked package records. It is not an application screenshot.

Project identity

Project
v-hacd
Publisher
Not authoritatively mapped
Native package records
4
Operating systems
fedora-43, fedora-44
License expression
BSD-3-Clause
Source repository
Open source repository

Source-reported description

The fullest retained description is shown with its source. Distribution packaging descriptions may include downstream details.

The V-HACD library decomposes a 3D surface into a set of “near” convex parts. Why do we need approximate convex decomposition? Collision detection is essential for realistic physical interactions in video games and computer animation. In order to ensure real-time interactivity with the player/user, video game and 3D modeling software developers usually approximate the 3D models composing the scene (e.g. animated characters, static objects…) by a set of simple convex shapes such as ellipsoids, capsules or convex-hulls. In practice, these simple shapes provide poor approximations for concave surfaces and generate false collision detection. Convex-hull vs. ACD A second approach consists in computing an exact convex decomposition of a surface S, which consists in partitioning it into a minimal set of convex sub-surfaces. Exact convex decomposition algorithms are NP-hard and non-practical since they produce a high number of clusters. To overcome these limitations, the exact convexity constraint is relaxed and an approximate convex decomposition of S is instead computed. Here, the goal is to determine a partition of the mesh triangles with a minimal number of clusters, while ensuring that each cluster has a concavity lower than a user defined threshold. The v-hacd-tools package contains command-line tools based on the V-HACD library. Currently, this means TestVHACD; despite the name, this tool has general utility beyond testing.

Description source

Packages by operating system

Compare recorded versions, then open a package for dependency, file, checksum, and repository evidence. Version strings are distribution-specific, not a ranking of newer software.

Fedora 43

  1. Package v-hacd-devel

    43 (Fedora 43) (Unspecified): Development files for V-HACD

    4.1.0-14.fc43: noarch

    Source: v-hacd

  2. Package v-hacd-tools

    43 (Fedora 43) (Unspecified): Command-line tools based on the V-HACD library

    4.1.0-14.fc43: aarch64 x86_64

    Source: v-hacd

Fedora 44

  1. Package v-hacd-devel

    44 (Fedora 44) (Unspecified): Development files for V-HACD

    4.1.0-15.fc44: noarch

    Source: v-hacd

  2. Package v-hacd-tools

    44 (Fedora 44) (Unspecified): Command-line tools based on the V-HACD library

    4.1.0-15.fc44: aarch64 x86_64

    Source: v-hacd

Project resources and further reading

Mapping provenance

Only source-backed identity signals create public cross-OS links. A reviewer can later approve or dispute an inferred relationship without rewriting native package history.

No field-level source record is published yet.