| Key | Value |
|---|---|
| FileName | ./usr/lib64/R/library/geometry/R/geometry.rdb |
| FileSize | 77123 |
| MD5 | 543D944BFBF509926A7FB9BF5C8E320E |
| SHA-1 | 0A9DFC3CC2EC99AB73A0061C44D38CC2A74C232A |
| SHA-256 | A78D002FD286037C28FEA8D8A1F9EDDE1F8AA21D9A480896E05E396C92CB2256 |
| SSDEEP | 1536:z8N3Xa5WCnjcQHK8D5M7PRYwuPkzy2NBGQWCnX/fhy:9jz4O8zgQWC34 |
| TLSH | T1287301A20768698350CA0BD595765DFA2CC0315DD9271C7F7A3CD48098CE22BB9B8EDF |
| hashlookup:parent-total | 1 |
| hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| MD5 | ED51A24F38597674AC5650C57B486212 |
| PackageArch | x86_64 |
| PackageDescription | Makes the 'Qhull' library <http://www.qhull.org> available in R, in a similar manner as in Octave and MATLAB. Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2D, 3D, 4D, and higher dimensions. It implements the Quickhull algorithm for computing the convex hull. Qhull does not support constrained Delaunay triangulations, or mesh generation of non-convex objects, but the package does include some R functions that allow for this. |
| PackageName | R-geometry |
| PackageRelease | lp152.2.7 |
| PackageVersion | 0.4.5 |
| SHA-1 | 09EED3B9FDD8D20A8941AE739CCEC99C7B2D445C |
| SHA-256 | 0617C18474C65E8C7AB2A6797D7B973316F5BAA364E4EBA5A20F371A1CA86B7E |