Glen Meeden <glen@stat.umn.edu> and  Radu Lazar <lazar@stat.umn.edu>
Generate dependent samples from a non-full dimensional polytope
via a Markov Chain sampler

Glen Meeden <glen@stat.umn.edu> and Radu Lazar
<lazar@stat.umn.edu> and Charles J. Geyer <charlie@stat.umn.edu>
Simulate via Markov chain Monte Carlo (hit-and-run algorithm)
a Dirichlet distribution conditioned to satisfy a finite set of linear
equality and inequality constraints (hence to lie in a convex polytope
that is a subset of the unit simplex).

Sensitivity Indexes Calculated from Polynomial Chaos Expansions
A. Bouvier [aut], J.-P. Gauchi [cre], A. Bensadoun [aut]
Computation of sensitivity indexes by using a method based on a truncated Polynomial Chaos Expansions of the response.
The necessary condition of the method is: the inputs must be uniformly and independently sampled. Since the inputs are uniformly distributed, the truncated Polynomial Chaos Expansion is built from the multivariate Legendre orthogonal polynomials.
generic.R UtilPolychaos.R analyticsPolyLeg.R PCEdesign-class.R
PCEfit-class.R PCEpoly-class.R PCESI.R polyLeg.R

Original code by Angus Johnson, ported to R by Adrian Baddeley
R port of the Clipper library. Performs polygon clipping operations (intersection, union etc) using Vatti's clipping algorithm.

Angus Johnson. Ported to R by Adrian Baddeley and Brian Ripley.
R port of the Clipper library. Performs polygon clipping operations (intersection, union etc).

c(person("Angus", "Johnson", role = "aut",
comment="C++ original, http://www.angusj.com/delphi/clipper.php"),
person("Adrian", "Baddeley", role = c("aut", "trl", "cre"),
email = "Adrian.Baddeley@curtin.edu.au"),
person("Kurt", "Hornik", role = "ctb"),
person(c("Brian", "D."), "Ripley", role = "ctb"),
person("Elliott", "Sales de Andrade", role="ctb"),
person("Paul", "Murrell", role = "ctb"))
R port of Angus Johnson's open source library Clipper. Performs polygon clipping operations (intersection, union, set minus, set difference) for polygonal regions of arbitrary complexity, including holes. Computes offset polygons (spatial buffer zones, morphological dilations, Minkowski dilations) for polygonal regions and polygonal lines. Computes Minkowski Sum of general polygons. There is a function for removing self-intersections from polygon data.
Angus Johnson [aut] (C++ original,
http://www.angusj.com/delphi/clipper.php),
Adrian Baddeley [aut, trl, cre],
Kurt Hornik [ctb],
Brian D. Ripley [ctb],
Elliott Sales de Andrade [ctb],
Paul Murrell [ctb]