Result for 3E7C5C22AF01CF8326631E7D9C9FE788DE119444

Query result

Key Value
FileName./usr/lib/.build-id/10/b87f028dc7106fbd2de8b3586cf5effcecbf11
FileSize24
MD5B585BBA08BA447185E49EE5D44F66AFA
SHA-13E7C5C22AF01CF8326631E7D9C9FE788DE119444
SHA-256EE47B1A6D0D9069FA588AFEE88A2B1A58B8C5BE5466F8DFB6A5FCDFDEE4433B8
SSDEEP3:gCDNr:Xt
TLSH
hashlookup:parent-total25
hashlookup:trust100

Network graph view

Parents (Total: 25)

The searched file hash is included in 25 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD5D1ACCC428B26B2315C020B8BE5D3718C
PackageArchx86_64
PackageDescriptionQhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull.
PackageMaintainerghibo <ghibo>
PackageNameqhull
PackageRelease6.mga9
PackageVersion2020.2
SHA-104723785AC7BD057C3E6F51832E93133CD82C5CD
SHA-2568BC85DC38BA19DF3C76DD6B17D55C1CE3F304572E4E724928D11BAD99FC6FBD1
Key Value
MD59A134C60CFE74EFC55428FF3335F82AA
PackageArchx86_64
PackageDescriptionQhull is a general dimension convex hull program that reads a set of points from stdin, and outputs the smallest convex set that contains the points to stdout. It also generates Delaunay triangulations, Voronoi diagrams, furthest-site Voronoi diagrams, and halfspace intersections about a point.
PackageMaintainerFedora Project
PackageNameqhull
PackageRelease3.fc32
PackageVersion7.2.1
SHA-10C7EBC2771204AFC46394B1CC43702F9EB08B6DE
SHA-256CBBAF8F255974E162168A4739ED247CEE5D68498D0BD8FEB157ED3BBCA3137D1
Key Value
MD5AD9A277EB9BF1E62EE6B43F03C3E482F
PackageArchaarch64
PackageDescriptionQhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull.
PackageMaintainerdaviddavid <daviddavid>
PackageNameqhull
PackageRelease4.mga8
PackageVersion2020.2
SHA-13B506FCD5B392AACE392778CC16BF2FC7FBE47F2
SHA-25623C7806117A7DEAE4F782FD35C45B1513D10286C7F6D0B0D57747094B910E0B9
Key Value
MD5AE08C645CF87381864223A13C54DB2FD
PackageArcharmv7hl
PackageDescriptionQhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull.
PackageMaintainerumeabot <umeabot>
PackageNameqhull
PackageRelease2.mga7
PackageVersion2015.2
SHA-1403F9E84DE957830C1B05346CE7449F8B20A4106
SHA-256A718DF34093E1E521FE81F7EC22ED82829AFC52F8E722D6174401F9801F85AB1
Key Value
MD5B13BFFDA6298BCEC39F1E4A9B1D099BF
PackageArchi586
PackageDescriptionQhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull.
PackageMaintainerghibo <ghibo>
PackageNameqhull
PackageRelease6.mga9
PackageVersion2020.2
SHA-1460EE3EF2B8F98308703830C58BAC01A55132315
SHA-256D4CAF69F73BAA0AAD71BA39FABC58E9CCF21C1B61977C67745F1262E2FA94D6B
Key Value
MD53F3F527B98A5202595A279CF6F305799
PackageArchi586
PackageDescriptionQhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull.
PackageMaintainerumeabot <umeabot>
PackageNameqhull
PackageRelease2.mga7
PackageVersion2015.2
SHA-1502F936FB1ACD527B990E3CEAA5E4B8E720BB8AD
SHA-256B579BC4602AEFEEDD2E8F681329C5B6D4F36FECE375750732EAF460151B95C9E
Key Value
MD555D2FB3C735C058185D2DAAAC1F9538A
PackageArchaarch64
PackageDescriptionQhull is a general dimension convex hull program that reads a set of points from stdin, and outputs the smallest convex set that contains the points to stdout. It also generates Delaunay triangulations, Voronoi diagrams, furthest-site Voronoi diagrams, and halfspace intersections about a point.
PackageMaintainerFedora Project
PackageNameqhull
PackageRelease3.fc32
PackageVersion7.2.1
SHA-15F777620896F5797197845BD4C7DA00A11DF88D9
SHA-256EACB6DD670C2E35A98155F6C817D8FA2B0D1F683DE22F30B20DCAD2FCF19E78A
Key Value
MD55DFD4698E945D7A787164F3BCED370F5
PackageArchaarch64
PackageDescriptionQhull is a general dimension convex hull program that reads a set of points from stdin, and outputs the smallest convex set that contains the points to stdout. It also generates Delaunay triangulations, Voronoi diagrams, furthest-site Voronoi diagrams, and halfspace intersections about a point.
PackageMaintainerFedora Project
PackageNameqhull
PackageRelease6.fc33
PackageVersion7.2.1
SHA-1763C8D857505C92702DC4CA2533738C7B1BEB428
SHA-2565055593B230C4DE51F6AABE22A882A150F54328CA0240ED0A0EA9FD0260017E7
Key Value
MD5E0C8B4E2BE3C4F8AB01EB6FAEEC75E0A
PackageArchaarch64
PackageDescriptionQhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull.
PackageMaintainerghibo <ghibo>
PackageNameqhull
PackageRelease6.mga9
PackageVersion2020.2
SHA-17830266BF351179C1E1BAD8EB56D4FF170267586
SHA-2565CA1849110D793E763A3B26CC75C46B24610BEA6A17AE1564E8747BA859C56EE
Key Value
MD5F3C79145F3226F77917E69C3EB6231F7
PackageArchx86_64
PackageDescriptionQhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull handles roundoff errors from floating point arithmetic. It can approximate a convex hull.
PackageMaintainerumeabot <umeabot>
PackageNameqhull
PackageRelease2.mga7
PackageVersion2015.2
SHA-178E4C09653A8972816A01811DD4C48C606352ADF
SHA-256E0ADAE62F9DCBE826472981AE6C2268C584AA5263E8834591537C3A45FE8C01B