Results per Page:  
Search in: R Manuals Base Packages Help Pages | CRAN Task Views
CRAN Packages Description Help Pages News Readme Vignettes

Matching any words Matching all words
1-10 of about 50 matches
Term frequencies: convex: 2,963, hull: 1,450
Search took 0.005079 seconds

Size: 1.7K
R: Convex hull points
convex.hulls {Cluster.OBeu} R Documentation Convex hull points Description Computes points to plot a convex hull for each cluster of the clustering model Usage convex.hulls(clustering.model, data.pca)...
/CRAN/refmans/Cluster.OBeu/html/convex.hulls.html
 all  matching: convex, convex, convex, hull, hull and hull


Size: 2.4K
R: Convex hull of a set of vertices
...resverts The indices of the input vertices that constritute the convex hull. rescoords The coordinates of the corners of the convex hull. Author(s) Tamas Nepusz ntamas@gmail.com References Thomas H.
/CRAN/refmans/igraph/html/convex_hull.html
 all  matching: convex, convex, convex, hull, hull and hull


Size: 1.6K
R: Convex hull of a set of vertices
convex.hull {igraph} R Documentation Convex hull of a set of vertices Description convex.hull() was renamed to convex_hull() to create a more consistent API. Usage convex.hull...
/CRAN/refmans/igraph/html/convex.hull.html
 all  matching: convex, convex, convex, hull, hull and hull


Size: 3.3K
R: Determines if points are on the convex hull of a...
...Given a triangulation tri.obj of n points in the plane, this subroutine returns a logical vector indicating if the points (x_i,y_i) lay on the convex hull of tri.obj. Usage on.convex.hull(tri.obj, x...
/CRAN/refmans/tripack/html/on.convex.hull.html
 all  matching: convex, convex, convex, hull, hull and hull


Size: 3.2K
R: Determines if points are in the convex hull of a...
...a triangulation tri.obj of n points in the plane, this subroutine returns a logical vector indicating if the points (x_i,y_i) are contained within the convex hull of tri.obj. Usage in.convex.hull(tri...
/CRAN/refmans/tripack/html/in.convex.hull.html
 all  matching: convex, convex, convex, hull, hull and hull


Size: 3.5K
R: Return the convex hull of a triangulation object
...boundary of the convex hull. Usage convex.hull(tri.obj, plot.it=FALSE, add=FALSE,...) Arguments tri.obj object of class "tri" plot.it logical, if TRUE the convex hull of tri.obj will be plotted. add...
/CRAN/refmans/tripack/html/convex.hull.html
 all  matching: convex, convex, convex, hull, hull and hull


Size: 3.9K
R: Return the convex hull of a triangulation object
...the nodes on the boundary of the convex hull. ConvexHull is an experimental C++ implementation of Grahams Scan without previous triangulation, should be much faster. Usage convex.hull(tri.obj, plot.it...
/CRAN/refmans/interp/html/convex.hull.html
 all  matching: convex, convex, convex, hull, hull and hull


Size: 3.0K
R: Check whether treated unit is in the convex hull of donors
...unit is in the convex hull of donors Description This function finds out if the treated unit is in the convex hull of the donor units. Usage in_convex_hull(X1, X0, ...) Arguments X1 ⁠N_covars by 1...
/CRAN/refmans/pensynth/html/in_convex_hull.html
 all  matching: convex, convex, convex, hull, hull and hull


Size: 3.8K
R: Determines if points are on or in the convex hull of a...
...subroutine returns a logical vector indicating if the points (x_i,y_i) lay on or in the convex hull of tri.obj. Usage on.convex.hull(tri.obj, x, y, eps=1E-16) in.convex.hull(tri.obj, x, y, eps=1E-16...
/CRAN/refmans/interp/html/on.convex.hull.html
 all  matching: convex, convex, convex, hull, hull and hull


Size: 2.8K
R: Minimum convex hull
...Minimum convex hull Description Creates a vector convex polygon around vector features. Usage wbt_minimum_convex_hull( input, output, features = TRUE, wd = NULL, verbose_mode = NULL, compress_rasters...
/CRAN/refmans/whitebox/html/wbt_minimum_convex_hull.html
 all  matching: convex, convex, convex, hull, hull and hull




powered by xapian
hosted and maintained by the Institute for Statistics and Mathematics
of WU (Vienna University of Economics and Business)
give a feedback