<?xml version="1.0" encoding="UTF-8"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>Extension to 'spatstat' for Large Datasets on a Linear Network</dc:title>
  <dc:title>R package spatstat.Knet version 3.1-3</dc:title>
  <dc:description>Extension to the 'spatstat' family of packages, for analysing
	     large datasets of spatial points on a network. The geometrically-
	     corrected K function is computed using a memory-efficient
	     tree-based algorithm described by Rakshit, Baddeley and Nair (2019).</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Depends: R (&gt;= 3.5.0), spatstat.data (&gt;= 3.1-9), spatstat.sparse (&gt;=
3.1-0), spatstat.univar (&gt;= 3.2-0), spatstat.geom (&gt;= 3.7-3),
spatstat.random (&gt;= 3.4-5), spatstat.explore (&gt;= 3.8-0),
spatstat.model (&gt;= 3.7-0), spatstat.linnet (&gt;= 3.5-0), spatstat
(&gt;= 3.6-0)</dc:relation>
  <dc:relation>Imports: spatstat.utils (&gt;= 3.2-3), Matrix</dc:relation>
  <dc:creator>Adrian Baddeley &lt;Adrian.Baddeley@curtin.edu.au&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Suman Rakshit [aut, cph] (ORCID:
    &lt;https://orcid.org/0000-0003-0052-128X&gt;),
  Adrian Baddeley [cre, cph] (ORCID:
    &lt;https://orcid.org/0000-0001-9499-8382&gt;)</dc:contributor>
  <dc:rights>GPL (&gt;= 2)</dc:rights>
  <dc:date>2026-05-22</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=spatstat.Knet</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.spatstat.Knet</dc:identifier>
</oai_dc:dc>
