starthas been enabled in
lasclip*can extract from a catalog.
lastreesgains a new algorithm from Silva et al. (2016).
lastreeswith the Li et al. (2012) algorithm gains a new parameter to prevent over-segmentation.
lassnagsfor classifying points as snag points or for segmenting snags.
tree_detectionto detect individual trees. This feature has been extracted from
lastrees’s algorithms and it is now up to the users to use
lidR’s algos or other input sources.
plotsupports natively the
PointCloudViewerpackage avaible on github.
lastreeswith the Li et al. (2012) algorithm is now 5-6 times faster and much more memory efficient.
lastreeswith the Li et al. (2012) algorithm no longer sorts the original point cloud.
lastreeswith the Dalponte et al (2016) algorithm is now computed in linear time and is therefore hundreds to millions times faster.
catalog_reshape()streams the data and uses virtually zero memory to run.
grid_canopy()has been rewritten entirely in C++ and is now 10 to 20 times faster both with the option
subcircleor without it.
grid_canopy()with the option
subcircleuses only 16 bytes of extra memory to run, while this feature previously required the equivalent of several copies of the point cloud (several hundreds of MB).
as.raster()is now three times faster.
lasclassifynow uses a QuadTree and is therefore faster. This enables several algorithms to run faster, such as
lastreeswith Silva’s algo.
lasgroundwith the PMF algorithm now accepts user-defined sequences.
lasgroundwith the PMF algorithm has simplified parameter names to make them easier to type and understand, and to prepare the package for new algorithms.
lasgrounddocumentation is more explicit about the actual algorithm used.
lasgroundnow computes the windows size more closely in line with the original Zhang paper.
lastreeswhen used with raster-based methods now accepts a missing las object. In that case
extrais turned to
p(for power) added to functions that enable spatial interpolation with IDW.
This version is dedicated to extending functions and processes to entire catalogs in a continuous way. Major changes are:
catalog_applyworks. More powerful but no longer compatible with previous releases
catalog_applyhas been entirely re-designed. It is more flexible, more user-friendly and enables loading of buffered data.
catalog_querieshas now an argument
...to pass any argument of
catalog_querieshas now an argument
bufferto load extra buffered points around the region of interest.
grid_metricsaccepts a catalog as input. It allows users to grid an entire catalog in a continuous way.
grid_densityalso inherits this new feature
grid_terrainalso inherits this new feature
grid_canopyalso inherits this new feature
grid_tincanopyalso inherits this new feature
grid_metricshas now has an argument
filterfor streaming filters when used with a catalog
lasnormalizeupdates the point cloud by reference and avoids making deep copies. An option
copy = TRUEis available for compatibility with former versions.
readLASarguments changed. The new syntax is simpler. The previous syntax is still supported.
catalog_indexis no longer an exported function. It is now an internal function.
plot.Catalogaccepts the usual
catalog_applydo not expect a parameter
mc.cores. This is now driven by global options in
lasmetricsdo not expect a parameter
debug. This is now driven by global options in
catalogcan build a catalog from a set of paths to files instead of a path to a folder.
$access to LAS attribute (incredibly slow)
catalog_selectis more pleasant an more interactive to use.
Catalogclass is now a S4
LAScatalogclass gain a slot
crsautomatically filled with a proj4 string
plot.LAScatalogdisplay a google map background if the catalog has a CRS.
plot.LAScataloggains an argument
yto display a either a terrain, raod, satellite map.
lasareais deprecated. Use the more generic function
writeLASfor skipped fields when no field is skipped is now correct.
grid_terrainwith delaunay allocates less memory, makes fewer deep copies and is 2 to 3 times faster
grid_terrainwith knnidw allocates less memory, makes fewer deep copies and is 2 to 3 times faster
lasclassifyno longer rely on
raster::extractbut on internal
fast_extract, which is memory efficient and more than 15 times faster.
LAScatalogto be built 8 times faster than previously.
RANNpackage using internal k-nearest neighbor search (2 to 3 times faster)
grid_tincanopy()gains a parameter
rumple_indexfor measuring roughness of a digital model (terrain or canopy)
x > 0was replaced by
x >= 0to avoid errors in the canopy height models
lastreesLi et al. algorithm for tree segmentation is now ten to a thousand of times faster than in v1.2.0
grid_terrain, the interpolation is now done only within the convex hull of the point cloud
grid_tincanopymakes the triangulation only for highest return per grid cell.
grid_terrainusing Delaunay triangulation is now ten to a hundred times faster than in v1.2.0
as.rasternow relies on
spand is more flexible
as.rasterautomatically returns a
RasterStackif no layer is provided.
as.rasterchanges and can display a
lasgroundfor ground segmentation.
grid_tincanopy. Canopy height model using Khosravipour et al. pit-free algorithm.
grid_hexametrics. Area-based approach in hexagonal cells.
lasnormalizeallows for “non-discretized” normalization i.e interpolating each point instead of using a raster.
lascheckperforms more tests to check if the header is in accordance with the data.
gap_fraction_profile()bug with negative values (thanks to Florian de Boissieu)
max(Z) = 0
grid_terrain, forcing the lowest point to be retained is now an option
keep_lowest = FALSE
lastree()for individual tree segmentation
readLAS()gains a parameter
rlas (>= 1.1.0)
rlas (>= 1.1.0). It saves a lot of memory, is 2 to 6 times faster and supports .lax files.
plot.LAS()now expects a list of colors instead of a function. Use
akimais now called
delaunaybecause it corresponds to what is actually computed.
akimalost its parameter
krigingnow performs a KNN kriging.
catalog_queries()lost the parameter
...all the fields are loaded by default.
lasterrain()which was not consistent with other functions and not useful.
Number of point recordsand
Number of nth return.
lasnormalize()updates the header and returns warnings for some behaviors
Second submission - rejected
First submission - rejected