- Add new port: math/R-cran-geometry
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.
WWW: https://cran.r-project.org/web/packages/geometry/
2018-04-11 01:53:33 -04:00
|
|
|
PORTNAME= geometry
|
2022-07-15 02:02:39 -04:00
|
|
|
DISTVERSION= 0.4.6.1
|
- Add new port: math/R-cran-geometry
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.
WWW: https://cran.r-project.org/web/packages/geometry/
2018-04-11 01:53:33 -04:00
|
|
|
CATEGORIES= math
|
|
|
|
DISTNAME= ${PORTNAME}_${DISTVERSION}
|
|
|
|
|
|
|
|
MAINTAINER= tota@FreeBSD.org
|
|
|
|
COMMENT= Mesh Generation and Surface Tesselation
|
2022-09-07 17:06:12 -04:00
|
|
|
WWW= https://cran.r-project.org/web/packages/geometry/
|
- Add new port: math/R-cran-geometry
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.
WWW: https://cran.r-project.org/web/packages/geometry/
2018-04-11 01:53:33 -04:00
|
|
|
|
|
|
|
LICENSE= GPLv3
|
|
|
|
|
2020-04-08 02:48:09 -04:00
|
|
|
CRAN_DEPENDS= R-cran-magic>0:math/R-cran-magic \
|
|
|
|
R-cran-Rcpp>0:devel/R-cran-Rcpp \
|
|
|
|
R-cran-lpSolve>0:math/R-cran-lpSolve \
|
|
|
|
R-cran-linprog>0:math/R-cran-linprog \
|
|
|
|
R-cran-RcppProgress>0:devel/R-cran-RcppProgress
|
- Add new port: math/R-cran-geometry
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.
WWW: https://cran.r-project.org/web/packages/geometry/
2018-04-11 01:53:33 -04:00
|
|
|
BUILD_DEPENDS= ${CRAN_DEPENDS}
|
|
|
|
RUN_DEPENDS= ${CRAN_DEPENDS}
|
|
|
|
|
2020-04-08 02:48:09 -04:00
|
|
|
USES= cran:auto-plist,compiles
|
|
|
|
|
- Add new port: math/R-cran-geometry
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.
WWW: https://cran.r-project.org/web/packages/geometry/
2018-04-11 01:53:33 -04:00
|
|
|
.include <bsd.port.mk>
|