Key | Value |
---|---|
FileName | ./usr/lib/R/site-library/geometry/doc/qhull/index.html |
FileSize | 15007 |
MD5 | 2EB8BC5B61FDA76C7AF2B05D5B983013 |
SHA-1 | 14EF18BE9260265FB631B94BC668FA3B9F6C7C21 |
SHA-256 | B3B23F26E58143AC19C4FFD31AC4A8A11C4D52A7A48CC6C9DD66AAFA7A39A07A |
SSDEEP | 192:WhiyMUjRK2jolrUqUQn1HPHrXSNyaG9EbG9Y+hyWajOyd9cihn1m9GDH4ErhiyMF:W1ol5P7SYFY+hxaCyt1m9GDHHa |
TLSH | T1B86260F965D062894396F7053EE062BDA92341E3B48438CA729D8C3FEF81B81955339F |
hashlookup:parent-total | 27 |
hashlookup:trust | 100 |
The searched file hash is included in 27 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 | 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 |
---|---|
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 |
---|---|
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 |
Key | Value |
---|---|
FileSize | 707816 |
MD5 | 09F0530E653C3137ECF7CC6413F46563 |
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 | 5466DDCD74475122ADE149513820705088AFA5AF |
SHA-256 | 7C32570F8B3B94104035772631C188F9A67E58C460C294EB296FF6169B1E64A7 |
Key | Value |
---|---|
MD5 | 55D2FB3C735C058185D2DAAAC1F9538A |
PackageArch | aarch64 |
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 | 5F777620896F5797197845BD4C7DA00A11DF88D9 |
SHA-256 | EACB6DD670C2E35A98155F6C817D8FA2B0D1F683DE22F30B20DCAD2FCF19E78A |
Key | Value |
---|---|
MD5 | 5DFD4698E945D7A787164F3BCED370F5 |
PackageArch | aarch64 |
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 | 6.fc33 |
PackageVersion | 7.2.1 |
SHA-1 | 763C8D857505C92702DC4CA2533738C7B1BEB428 |
SHA-256 | 5055593B230C4DE51F6AABE22A882A150F54328CA0240ED0A0EA9FD0260017E7 |
Key | Value |
---|---|
MD5 | B631259FDCA679940DD5888430BFE649 |
PackageArch | ppc64le |
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 | CBS <cbs@centos.org> |
PackageName | qhull |
PackageRelease | 2.el8 |
PackageVersion | 7.2.1 |
SHA-1 | 812C52CB7DD4B6A2C27C2CA99CF60D57EF9CA7AB |
SHA-256 | 2C48E08319346A9A4994B8B55A7718E44059447DFAA4789DB9C56289A0128280 |
Key | Value |
---|---|
MD5 | 9B1574ED78046939CF6B390B60D34230 |
PackageArch | aarch64 |
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 | CBS <cbs@centos.org> |
PackageName | qhull |
PackageRelease | 2.el8 |
PackageVersion | 7.2.1 |
SHA-1 | 8D70A4706C2E7CDE1DE26CC139B24ECCB782D226 |
SHA-256 | 9E7C1ADF06DEBB84D139A8DBF91AAE3FA59FFAFC4F4D77278577E15B9488CB4D |