trimesh

T is a <code>m</code>-by-3 matrix. A row of <code>T</code>
  contains indices into <code>X</code> of the vertices of a
  triangle. <code>T</code> is usually the output of
  <code><a href="/link/delaunayn?package=geometry&version=0.3-2" rd-options="" data-mini-rdoc="geometry::delaunayn">delaunayn</a></code>.

if <code>p</code> is not a matrix <code>p</code> and
  <code>p2</code> are bind to a matrix with <code>cbind</code>.

Add to existing plot in current active
  device?

axis

boxed

Parameters to the rendering device. See the
  <a href="/link/rgl?package=geometry&version=0.3-2&to=rgl" rd-options="rgl" data-mini-rdoc="rgl::rgl">rgl</a> package.

<code>trimesh(T, p)</code> displays the triangles defined in
  the m-by-3 matrix <code>T</code> and points <code>p</code> as a mesh.
  Each row of <code>T</code> specifies a triangle by giving the 3
  indices of its points in <code>X</code>.

hplot

This 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.

trimesh: Display triangles mesh (2D)

Description

Usage

Arguments

See Also

Examples