[Bug 2168594] New: Review Request: v-hacd - Decomposes a 3D surface into a set of “near” convex parts

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



https://bugzilla.redhat.com/show_bug.cgi?id=2168594

            Bug ID: 2168594
           Summary: Review Request: v-hacd - Decomposes a 3D surface into
                    a set of “near” convex parts
           Product: Fedora
           Version: rawhide
          Hardware: All
                OS: Linux
            Status: NEW
         Component: Package Review
          Severity: medium
          Priority: medium
          Assignee: nobody@xxxxxxxxxxxxxxxxx
          Reporter: code@xxxxxxxxxxxxxxxxxx
        QA Contact: extras-qa@xxxxxxxxxxxxxxxxx
                CC: package-review@xxxxxxxxxxxxxxxxxxxxxxx
  Target Milestone: ---
    Classification: Fedora



Spec URL: https://music.fedorapeople.org/v-hacd.spec
SRPM URL: https://music.fedorapeople.org/v-hacd-4.1.0-1.fc37.src.rpm

Description:

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.

Fedora Account System Username: music

Koji scratch builds:

F39: https://koji.fedoraproject.org/koji/taskinfo?taskID=97306550
F38: https://koji.fedoraproject.org/koji/taskinfo?taskID=97306551
F37: https://koji.fedoraproject.org/koji/taskinfo?taskID=97306556
F36: https://koji.fedoraproject.org/koji/taskinfo?taskID=97306558

This is an optional dependency for python-trimesh.


-- 
You are receiving this mail because:
You are on the CC list for the bug.
You are always notified about changes to this product and component
https://bugzilla.redhat.com/show_bug.cgi?id=2168594
_______________________________________________
package-review mailing list -- package-review@xxxxxxxxxxxxxxxxxxxxxxx
To unsubscribe send an email to package-review-leave@xxxxxxxxxxxxxxxxxxxxxxx
Fedora Code of Conduct: https://docs.fedoraproject.org/en-US/project/code-of-conduct/
List Guidelines: https://fedoraproject.org/wiki/Mailing_list_guidelines
List Archives: https://lists.fedoraproject.org/archives/list/package-review@xxxxxxxxxxxxxxxxxxxxxxx
Do not reply to spam, report it: https://pagure.io/fedora-infrastructure/new_issue




[Index of Archives]     [Fedora Users]     [Fedora Desktop]     [Fedora SELinux]     [Yosemite Conditions]     [KDE Users]

  Powered by Linux