Learn R Programming
⚠️There's a newer version (2.01-45) of this package.Take me there.

splancs (version 2.01-3)

Spatial and Space-Time Point Pattern Analysis

Description

Spatial and Space-Time Point Pattern Analysis Functions

Copy Link

Version

Install

install.packages('splancs')

Monthly Downloads

18,356

Version

2.01-3

License

GPL version 2 or newer (see README).

Maintainer

Roger Bivand

Last Published

May 27th, 2024

Functions in splancs (2.01-3)

delpoints

Select points to delete from a points data set
dsquare

Distance-squared from a number of points to a number of sources
khat

K-function
stkhat

Space-time K-functions
ranpts

adjust number of random points in polygon
Fzero

Theoretical nearest neighbour distribution function
kernrat

Ratio of two kernel smoothings
Ghat

G nearest neighbour distribution function
as.points

Creates data in spatial point format
mse2d

Mean Square Error for a Kernel Smoothing
pdense

Overall density for a point pattern
kernel2d

Kernel smoothing of a point pattern
inout

Test points for inclusion in a polygon
plt

bins nearest neighbour distances
k12hat

Bivariate K-function
pip

Points inside or outside a polygon
pointmap

Graphics
rlabel

Randomly label two or more point sets
print.ribfit

Display the fit from tribble()
tribble

Diggle-Rowlingson Raised Incidence Model
spoints

Point Objects
splancs

Return version number and author information
bodmin

Bodmin Moors granite tors
khvmat

Covariance matrix for the difference between two K-functions
polymap

Graphics
Kenv.pcp

Calculate simulation envelope for a Poisson Cluster Process
Kenv.csr

Envelope of Khat from simulations of complete spatial randomness
kernel3d

Space-time kernel
cardiff

Locations of homes of juvenile offenders
n2dist

Nearest neighbours for two point patterns
bbox

Generate a bounding box round a point object
addpoints

Add points interactively to a point data set
triblik

Log-likelihood for the Diggle-Rowlingson raised incidence model
is.points

Point Objects
csr

Generate completely spatially random points on a polygon
nndistF

Nearest neighbour distances as used by Fhat()
kerview

A linked-window system for browsing space-time data
stmctest

Monte-Carlo test of space-time clustering
stdiagn

Summary plots for clustering analysis
Kenv.tor1

Modified envelope of K12hat from random toroidal shifts of two point patterns
okblack

Oklahoma black offenders
inpip

Select points inside a polygon
gridpts

Generate a grid of points
pcp.sim

Generate a Poisson Cluster Process
nndistG

Nearest neighbour distances as used by Ghat()
getpoly

Draw a polygon on the current graphics device
Kenv.tor

Envelope of K12hat from random toroidal shifts of two point patterns
tor.shift

Toroidal shift on a point data set
amacrines

Amacrines on/off data set
Fhat

F nearest neighbour distribution function
sbox

Generate a box surrounding a point object
pcp

Fit a Poisson cluster process
thin

Randomly thin a point data set
areapl

Calculate area of polygon
mpoint

Overlay a number of point patterns
stsecal

Standard error for space-time clustering
shift

Shift a point data set
zoom

Interactively specify a region of a plot for expansion
gen

generate points in polygon
uganda

Craters in Uganda
burkitt

Burkitt's lymphoma in Uganda
Kenv.label

Envelope of K1hat-K2hat from random labelling of two point patterns
npts

Number of points in data set
khvc

Covariance matrix for the difference between two K-functions
okwhite

Oklahoma white offenders
secal

Standard errors for the difference between two K-functions
bboxx

Generate a non-closed bounding polygon
southlancs

Cancer cases in Chorley-Ribble
rtor.shift

Random toroidal shift on a point data set
stvmat

Variance matrix for space-time clustering