mesh.hunif

A <code>n</code>-by-<code>m</code> matrix, each row representing a
point in an <code>m</code>-dimensional space.

Uniform desired edge length function of position to allow easy
definition of regions when passed as the <code>fh</code> argument of
<code><a rd-options="" href="/link/distmesh2d?package=geometry&version=0.3-6" data-mini-rdoc="geometry::distmesh2d">distmesh2d</a></code> or <code><a rd-options="" href="/link/distmeshnd?package=geometry&version=0.3-6" data-mini-rdoc="geometry::distmeshnd">distmeshnd</a></code>.

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.

David Sterratt

geometry

Mesh Generation and Surface Tesselation

C. B. Barber

Kai Habel

Raoul Grasman

Robert B. Gramacy

Andreas Stahel

David C. Sterratt

mesh.hunif function

Uniform desired edge length function of position to allow easy
definition of regions when passed as the <code>fh</code> argument of
<code><a rd-options='' href='distmesh2d'>distmesh2d</a></code> or <code><a rd-options='' href='distmeshnd'>distmeshnd</a></code>.

mesh.hunif: Uniform desired edge length

Description

Usage

Arguments

Value

See Also