| Key | Value |
|---|---|
| FileName | ./usr/lib/R/site-library/geometry/doc/qhull/README.txt |
| FileSize | 21849 |
| MD5 | 916939BB1FEE5B8CA7826FBCF7B53232 |
| SHA-1 | 2EDFF4B090F09785AF44E10B989171BF1211F167 |
| SHA-256 | F8C308C40F78B013CA0FCE920ADE774E90017BAD264463B064359A46B867218F |
| SSDEEP | 384:b2D+8A0l1wW9xYwRxF/XwSjgX8CgAWU9T3XGpgNvyt0i6Cl5phq8pUs+C:b2D50W93v/A3FWyTmpgZyW8Ss+C |
| TLSH | T1F7A2C83B5D1A96711A91C8B563886497E276C2ABBF50A800379D830C6B07B83D1FD7F7 |
| hashlookup:parent-total | 42 |
| hashlookup:trust | 100 |
The searched file hash is included in 42 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 734160 |
| MD5 | DF228A1AB481A777FB9061B53A7BA855 |
| PackageDescription | GNU R mesh generation and surface tesselation This GNU R package makes the qhull library (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 2-d, 3-d, 4-d, 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. Currently the package only gives access to Delaunay triangulation and convex hull computation. |
| PackageMaintainer | Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net> |
| PackageName | r-cran-geometry |
| PackageSection | gnu-r |
| PackageVersion | 0.4.5-1+b1 |
| SHA-1 | 03FAFB158FBBE5936AAD6418362255467A66B200 |
| SHA-256 | DDCF491AF61F02E1B5C56332B81CAC8916E48437AAE5C9C989822F920744A9D5 |
| Key | Value |
|---|---|
| MD5 | 554C89624A7363ABA336FF4E5167EF3B |
| PackageArch | x86_64 |
| PackageDescription | Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2D and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull. Qhull does not support constrained Delaunay triangulations, triangulation of non-convex surfaces, mesh generation of non-convex objects, or medium-sized inputs in 9-D and higher. |
| PackageMaintainer | https://bugs.opensuse.org |
| PackageName | qhull |
| PackageRelease | bp153.1.30 |
| PackageVersion | 2015.2 |
| SHA-1 | 075B5D09480676A9ED6AD3E7384444D1D6B81FD7 |
| SHA-256 | EFB360FE70329DA3E4E97316B8654294EB8E61E7B24E506723456CA8A76AE939 |
| 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 |
| Key | Value |
|---|---|
| MD5 | 9A134C60CFE74EFC55428FF3335F82AA |
| PackageArch | x86_64 |
| PackageDescription | Qhull 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. |
| PackageMaintainer | Fedora Project |
| PackageName | qhull |
| PackageRelease | 3.fc32 |
| PackageVersion | 7.2.1 |
| SHA-1 | 0C7EBC2771204AFC46394B1CC43702F9EB08B6DE |
| SHA-256 | CBBAF8F255974E162168A4739ED247CEE5D68498D0BD8FEB157ED3BBCA3137D1 |
| Key | Value |
|---|---|
| MD5 | BF35A16B03ACF320315D446105374982 |
| PackageArch | x86_64 |
| PackageDescription | Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2D and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull. Qhull does not support constrained Delaunay triangulations, triangulation of non-convex surfaces, mesh generation of non-convex objects, or medium-sized inputs in 9-D and higher. |
| PackageMaintainer | https://bugs.opensuse.org |
| PackageName | qhull |
| PackageRelease | lp151.2.3 |
| PackageVersion | 2015.2 |
| SHA-1 | 1CD55BF3D1C28E88C568FE0D88A19650EFFFE2F4 |
| SHA-256 | 2675CB1D3F7A5A45C4A8D64458A563457CDB79D45EAF1E233735B6BBFC9042AF |
| Key | Value |
|---|---|
| FileSize | 168826 |
| MD5 | FE9978072B63F82CEC9271969FCE4A25 |
| PackageDescription | calculate convex hulls and related structures (documentation files) 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 2-d, 3-d, 4-d, and higher dimensions. . This package contains the documentation for Qhull. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libqhull-doc |
| PackageSection | doc |
| PackageVersion | 2015.2-1 |
| SHA-1 | 20E09430C98AD8E9712F31959C561000462B9640 |
| SHA-256 | 1AA27462C6AA6A3E007EC17898794E0993BCC7EB59E13B0BFE385F4E531920A0 |
| Key | Value |
|---|---|
| FileSize | 209224 |
| MD5 | 6EDD9BD3AF9B6D097E83CF73CC14C112 |
| PackageDescription | calculate convex hulls and related structures (documentation files) 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 2-d, 3-d, 4-d, and higher dimensions. . This package contains the documentation for Qhull. |
| PackageMaintainer | Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org> |
| PackageName | libqhull-doc |
| PackageSection | doc |
| PackageVersion | 2015.2-4 |
| SHA-1 | 31647C3CBA29AFE130E19325D0EADA768DB08C2E |
| SHA-256 | C1DF399BB2E5C895795B712EFA2A79BC8A2784D728B4B8ED77B418E5573F997F |
| Key | Value |
|---|---|
| FileSize | 710472 |
| MD5 | 91D9698C2BB4BD595683A955427AA319 |
| PackageDescription | GNU R mesh generation and surface tesselation This GNU R package makes the qhull library (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 2-d, 3-d, 4-d, 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. Currently the package only gives access to Delaunay triangulation and convex hull computation. |
| PackageMaintainer | Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net> |
| PackageName | r-cran-geometry |
| PackageSection | gnu-r |
| PackageVersion | 0.4.5-1+b1 |
| SHA-1 | 3CF48D14A6837DC6932B9F0B5E7C387FC51ABC71 |
| SHA-256 | 5E4C6AA76C535A1DD5AA5D871CD1696AADB6F4A73F95A4ABD1DA1211A8AD232A |
| Key | Value |
|---|---|
| MD5 | AE08C645CF87381864223A13C54DB2FD |
| PackageArch | armv7hl |
| PackageDescription | 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 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. |
| PackageMaintainer | umeabot <umeabot> |
| PackageName | qhull |
| PackageRelease | 2.mga7 |
| PackageVersion | 2015.2 |
| SHA-1 | 403F9E84DE957830C1B05346CE7449F8B20A4106 |
| SHA-256 | A718DF34093E1E521FE81F7EC22ED82829AFC52F8E722D6174401F9801F85AB1 |
| Key | Value |
|---|---|
| FileSize | 725948 |
| MD5 | 97B5A4830C24ADF5C8747C12EB6A934A |
| PackageDescription | GNU R mesh generation and surface tesselation This GNU R package makes the qhull library (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 2-d, 3-d, 4-d, 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. Currently the package only gives access to Delaunay triangulation and convex hull computation. |
| PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | r-cran-geometry |
| PackageSection | gnu-r |
| PackageVersion | 0.4.5-1build1 |
| SHA-1 | 414D91052FF0BCB6A2F1B7CC3577C2821A18EA18 |
| SHA-256 | 909AE25E6F6A5874331D86B18E342E1B6C22C68E573481687BAB721D94857E06 |