distmap.lpp

Computes the distance from each pixel to the nearest
 point in the given point pattern on a linear network.

spatial

math

Defines types of spatial data on a linear network
and provides functionality for geometrical operations,
data analysis and modelling of data on a linear network,
in the 'spatstat' family of packages.
Contains definitions and support for linear networks, including creation of networks, geometrical measurements, topological connectivity, geometrical operations such as inserting and deleting vertices, intersecting a network with another object, and interactive editing of networks.
Data types defined on a network include point patterns, pixel images, functions, and tessellations.
Exploratory methods include kernel estimation of intensity on a network, K-functions and pair correlation functions on a network, simulation envelopes, nearest neighbour distance and empty space distance, relative risk estimation with cross-validated bandwidth selection. Formal hypothesis tests of random pattern (chi-squared, Kolmogorov-Smirnov, Monte Carlo, Diggle-Cressie-Loosmore-Ford, Dao-Genton, two-stage Monte Carlo) and tests for covariate effects (Cox-Berman-Waller-Lawson, Kolmogorov-Smirnov, ANOVA) are also supported.
Parametric models can be fitted to point pattern data using the function lppm() similar to glm(). Only Poisson models are implemented so far. Models may involve dependence on covariates and dependence on marks. Models are fitted by maximum likelihood.
Fitted point process models can be simulated, automatically. Formal hypothesis tests of a fitted model are supported (likelihood ratio test, analysis of deviance, Monte Carlo tests) along with basic tools for model selection (stepwise(), AIC()) and variable selection (sdr). Tools for validating the fitted model include simulation envelopes, residuals, residual plots and Q-Q plots, leverage and influence diagnostics, partial residuals, and added variable plots.
Random point patterns on a network can be generated using a variety of models.

Adrian Baddeley

spatstat.linnet

Linear Networks Functionality of the 'spatstat' Family

Rolf Turner

Ege Rubak

Greg McSwiggan

Tilman Davies

Mehdi Moradi

Suman Rakshit

Ottmar Cronie

distmap.lpp function

<dl> <dt>X</dt>
<dd>A point pattern on a linear network (object of class <code>"lpp"</code>).</dd> <dt>k</dt>
<dd>Integer. The distance to the <code>k</code>-th nearest data point
 will be computed.</dd> <dt>...</dt>
<dd>Arguments passed to <code>as.linim.linfun</code>
 to control pixel resolution.</dd></dl>

Arguments

Adrian Baddeley <a href="/link/Adrian.Baddeley%40curtin.edu.au?package=spatstat.linnet&version=3.2-2" data-mini-rdoc="spatstat.linnet::Adrian.Baddeley@curtin.edu.au">Adrian.Baddeley@curtin.edu.au</a>, Rolf Turner <a href="/link/rolfturner%40posteo.net?package=spatstat.linnet&version=3.2-2" data-mini-rdoc="spatstat.linnet::rolfturner@posteo.net">rolfturner@posteo.net</a> and Ege Rubak <a href="/link/rubak%40math.aau.dk?package=spatstat.linnet&version=3.2-2" data-mini-rdoc="spatstat.linnet::rubak@math.aau.dk">rubak@math.aau.dk</a>.

Author

Distance Map of Point Pattern on Linear Network — distmap.lpp

<dl>

 <dt>X</dt>
<dd>A point pattern on a linear network (object of class <code>"lpp"</code>).</dd>

 <dt>k</dt>
<dd>Integer. The distance to the <code>k</code>-th nearest data point
 will be computed.</dd>

 <dt>...</dt>
<dd>Arguments passed to <code>as.linim.linfun</code>
 to control pixel resolution.</dd>

</dl>

Adrian Baddeley <a href='mailto:Adrian.Baddeley@curtin.edu.au'>Adrian.Baddeley@curtin.edu.au</a>, Rolf Turner <a href='mailto:rolfturner@posteo.net'>rolfturner@posteo.net</a> and Ege Rubak <a href='mailto:rubak@math.aau.dk'>rubak@math.aau.dk</a>.

distmap.lpp: Distance Map of Point Pattern on Linear Network

Description

Usage

Value

Arguments

Author

Details

See Also

Examples