Description Usage Arguments Details Value Author(s) Examples
thin
thins out a polyline/polygon by removing points that
are deemed to have no visual effect under the given tolerance.
1 2 
x 
x coordinates of the points 
y 
y coordinates of the points 
tolerance 
maximum allowable distance for a point to be removed 
lock 
defines points that cannot be removed. Can be

method 
Must be one of 
id 
optional index 
shp 
shape object as returned by

max.width 
the maximum number of shapes that a single point can belong to. It determines the size of the adjacency table created in the process. 
all 
determines whether the thinning information is included in
the shape object and returned as the whole object ( 
thin
performs thinning of one or more polygons defined by
coordinates x
and y
, where polygons are separated by
NA
.
The default algorithm used here is very simple and fast: it performs a
linear scan through all points and for each convex point it measures
the distance of the point from a line connecting last unthinned point
and the subsequent point. If this distance is below tolerance it is
removed. Note that the x, y space must be Euclidean so coordinates
may need to be transformed accordingly (i.e. typically you don't want
to use uncorrected lat/lon!). This fast algorithm guarantees only
n * tolerance
accuracy with n
being the number of
subsequently removed points. The extra error will be more noticeable
for subsequent slowly drifting points.
The alternative algorithm (method = 2L
) additionally checks
whether any of the previously removed points would be out of tolerance
as well  this adds complexity (it is quardatic in the number of
removed points), but guarantees that the result is never further than
tolerance
away from the original shape.
The input x
, y
can contain multiple segments separated
by NA
(R polygon format). Segments are always assumed to be a
loop (you can still use keep
to force both ends to be
nonremovable).
thin.shp
performs a constrained thinning (eventually using
thin
) whereby segments that are shared by two or more polygons
are guaranteed to be shared even after thinning. This is done by
computing the index from each shared point to all the same points,
then comparing running segments that have the same shape id
list in that index and referenciong only the the first set of points
so that the thinnig of those will be used for all subsequent segments
of the same point sequence. In addition, all points as which the shape
id
list changes are declared as fixed points that cannot be
removed.
All points are compared by their actual coordinate value, no fudge factor is applied, so the source is assumed to be consistent.
thin
: logical vector of the same length as the number of points
with TRUE
for points that are kept and FALSE
for removed
points.
this.shp
: same as thin
if all = FALSE
, otherwise
the shp
shape obejct is augmented with thin
element
which contains the result of thin
and the object itself is
returned.
Simon Urbanek
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28  # load 2010 Census TIGER/Line(TM) state data (if included)
shp < system.file("shp","tl_2010_us_state10.shp.xz",package="fastshp")
if (nzchar(shp)) {
s < read.shp(xzfile(shp, "rb"), "pol")
# thin on a cylindrical projection (around ca. 37 deg lat)
t < lapply(s, function(o) thin(o$x / 1.25, o$y, 1e3, method = 1L))
par(mar = rep(0, 4))
plot(c(125,67), c(25, 49.4), asp=1.25, ty='n', axes=FALSE)
for (i in seq.int(s))
polygon(s[[i]]$x[t[[i]]], s[[i]]$y[t[[i]]], col="#eeeeee")
cat(" reduction: ", 100  sum(sapply(t, sum)) / sum(sapply(t, length)) * 100, "%\n", sep='')
# use the more conservative algorithm
t < lapply(s, function(o) thin(o$x / 1.25, o$y, 1e3, method = 2L))
cat(" reduction: ", 100  sum(sapply(t, sum)) / sum(sapply(t, length)) * 100, "%\n", sep='')
# use constrained thinning:
st < read.shp(xzfile(shp, "rb"), "table")
st$x < st$x / 1.25
a < thin.shp(st, 1e3)
cat(" reduction: ", 100  sum(a) / length(a) * 100, "%\n", sep='')
par(mfrow=c(1, 2))
# compare unconstrained and constrained thinning up close (NY/NJ area)
plot(0, 0, xlim=c(74.22, 74.15), ylim=c(40.55,40.67), asp=1.25, axes=FALSE)
for (i in seq.int(s))
polygon(s[[i]]$x[t[[i]]], s[[i]]$y[t[[i]]], col=c("#0000ff80","#80800080")[i %% 2 + 1L], border=1)
plot(0, 0, xlim=c(74.22, 74.15), ylim=c(40.55,40.67), asp=1.25, axes=FALSE)
for (i in unique(st$id))
polygon(st$x[st$id==i]*1.25, st$y[st$id==i], col=c("#0000ff80","#80800080")[i %% 2 + 1L], border=1)
}

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.