diff --git a/index.html b/index.html
index 0389079ccf252f55890ccf8d078dfcf2780405d6..c664dd9a386199fa3931e360fd5b1c81d90f21e8 100644
--- a/index.html
+++ b/index.html
@@ -2,126 +2,9 @@
<!DOCTYPE html PUBLIC
"-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN"
"http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg.dtd">
-<html xmlns='http://www.w3.org/1999/xhtml' xml:lang='en' xmlns:svg='http://www.w3.org/2000/svg'>
-<head><meta content='application/xhtml+xml;charset=utf-8' http-equiv='Content-type' /><title>The C(anonical) Scan Matcher</title></head>
-<body>
-<h1 id='the_canonical_scan_matcher'>The C(anonical) Scan Matcher</h1>
-
-<p><img alt='PL-ICP' src='sm_plicp_zoom_crop.gif' style='float: right; margin:1em;' /></p>
-
-<h3 id='news'>News</h3>
-
-<ul>
-<li>
-<p>Fall 2010: <a href='http://www.ros.org/wiki/canonical_scan_matcher'>CSM has been integrated and packaged</a> for <a href='http://www.ros.org/'>ROS</a> by <a href='http://robotics.ccny.cuny.edu/blog/People/Dryanovski'>Ivan Dryanovski</a>.</p>
-
-<h3 id='overview'>Overview</h3>
-</li>
-</ul>
-
-<p>This is a pure C implementation of a very fast variation of ICP using a point-to-line metric optimized for range-finder scan matching.</p>
-
-<p>The method is described in the paper:</p>
-<div class='pub-ref-desc'>
- <img src='http://purl.org/censi/web/media/paper-icons/plicp.jpg' class='icon' /><p class='pub-ref-short'><span class='author'>
-<p>
-<p>A.C..</p>
-</p>
-</span>
-<span class='title'>
-<p>
-<p>An ICP variant using a point-to-line metric.</p>
-</p>
-</span>
-<span class='booktitle'>
-<p>
-<p>In</p>
-</p>
-<em>
-<p>
-<p>Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)</p>
-</p>
-</em>
-<p>
-<p>. Pasadena, CA, May 2008.</p>
-</p>
-</span>
-<span class='links'><span class='pdf'><a href='http://purl.org/censi/research/2008-icra-plicp.pdf'><img src='/media/pdf.gif' style='border:0; margin-bottom:-6px' />
-<p>
-<p>pdf</p>
-</p>
-</a></span><span class='doi'><a href='http://dx.doi.org/10.1109/ROBOT.2008.4543181'>
-<p>
-<p>doi</p>
-</p>
-</a></span><span class='url'><a href='http://purl.org/censi/2007/plicp'><img src='/media/web.gif' style='border:0; margin-bottom:-6px; height: 17px' />
-<p>
-<p>supp. material</p>
-</p>
-</a></span><span class='slides'><a href='http://purl.org/censi/research/2008-icra-plicp-slides.pdf'><img src='/media/slides2.gif' style='border:0; margin-bottom:-6px; height: 17px;' />
-<p>
-<p>slides</p>
-</p>
-</a></span></span><a href='javascript:void(0)' class='pub-ref-bibtex-link' onclick='javascript:$("#censi08plicp").toggle();'>
-<p>
-<p>bibtex</p>
-</p>
-</a>
- <pre id='censi08plicp' style='display: none;' class='pub-ref-bibtex'>
-<pre><code>
-<p>author = “Censi, Andrea”, doi = “10.1109/ROBOT.2008.4543181”, title = “An {ICP} variant using a point-to-line metric”, url = “http://purl.org/censi/2007/plicp”, booktitle = “Proceedings of the {IEEE} International Conference on Robotics and Automation ({ICRA})”, year = “2008”, month = “May”, slides = “http://purl.org/censi/research/2008-icra-plicp-slides.pdf”, address = “Pasadena, CA”, pdf = “http://purl.org/censi/research/2008-icra-plicp.pdf”, abstract = “This paper describes PLICP, an ICP (Iterative Closest/Corresponding Point) variant that uses a point-to-line metric, and an exact closed-form for minimizing such metric. The resulting algorithm has some interesting properties: it converges quadratically, and in a finite number of steps. The method is validated against vanilla ICP, IDC (Iterative Dual Correspondences), and MbICP (Metric-Based ICP) by reproducing the experiments performed in Minguez et al. (2006). The experiments suggest that PLICP is more precise, and requires less iterations. However, it is less robust to very large initial displacement errors. The last part of the paper is devoted to purely algorithmic optimization of the correspondence search; this allows for significant speed-up of the computation. The source code is available for download.” }</p>
-</code></pre>
-</pre>
-</p><div class='desc'><p>
-<p>
-<p>An extremely fast and precise ICP variant for range-finder scan matching, which converges quadratically in a finite number of steps.</p>
-</p>
-<a href='http://purl.org/censi/2007/plicp'>
-<p>
-<p>The implementation is available</p>
-</p>
-</a>
-<p>
-<p>and included also in ROS.</p>
-</p>
-</p>
-</div>
-</div>
-<p>The package also contains two methods for estimating the uncertainty of scan matching. Those are described in the following papers:</p>
-
-<h3 id='download'>Download</h3>
-
-<ul>
-<li>
-<p>CSM can be download from GitHub (.zip package available) at the url:</p>
-<p><a href='http://github.com/AndreaCensi/csm'>http://github.com/AndreaCensi/csm</a></p>
-</li>
-</ul>
-
-<h3 id='documentation__getting_started'>Documentation / getting started</h3>
-
-<p>Please see the manual contained in “csm_manual.pdf”. See below for a quick description.</p>
-
-<p><strong>What is this.</strong> I created this package:</p>
-
-<ul>
-<li>
-<p>To have a well-documented reference implementation of <a href='http://purl.org/censi/2007/plicp'>PL-ICP</a>. If you are only interested in the core algorithm of PL-ICP, a <a href='http://purl.org/censi/2007/gpc'>separate concise implementation in C/Matlab/Ruby</a> is available.</p>
-</li>
-
-<li>
-<p>To have a <strong>trustworthy</strong> scan matcher to be used in the experiments for some papers on <a href='http://purl.org/censi/2006/icpcov'>ICP covariance</a>, <a href='http://purl.org/censi/2006/accuracy'>the Cramer-Rao bound for range finders</a>, and <a href='http://purl.org/censi/2007/calib'>robot calibration</a>. For batch experiments, it’s also useful that it’s pretty fast.</p>
-</li>
-
-<li>
-<p>To have a collection of utilies for command line (UNIX-style) manipulation of laser data, and creating <a href='../plicp/laserazosSM3.log.pdf'>beautiful maps</a> and animations.</p>
-</li>
-</ul>
-
-<p>The package contains also a Ruby wrapper for the C library, and additional Ruby and a Matlab implementations of the same algorithm. These are not as usable or documented as the C version.</p>
+<body>
+<p>Please see here: <a href='http://purl.org/censi/2007/csm'>http://purl.org/censi/2007/csm</a>.</p>
-<p><strong>What it is NOT</strong>: Note that this is not a full-featured SLAM solution: this only does pairwise scan-matching between scans (but it’s really good at it!). If you are looking for a more complete SLAM solution, please see the projects listed in the <a href='http://www.openslam.org'>OpenSLAM</a> page; in particular you can have a look at <a href='http://www.openslam.org/gmapping.html'>GMapping</a>. Many pointers to other SLAM software can be found on the pages of the Euron SLAM summer schools: <a href='http://www.cas.kth.se/SLAM/'>2002 (Stockholm)</a>, <a href='http://www.laas.fr/SLAM/'>2004 (Toulouse)</a>, <a href='http://www.robots.ox.ac.uk/~SSS06/Website/index.html'>2006 (Oxford)</a>. Other related projects are <a href='http://carmen.sourceforge.net/'>Carmen</a> and <a href='http://playerstage.sourceforge.net/'>Stage</a>.</p>
-<hr />
-<p>Please link to this page using the url <a href='http://purl.org/censi/2007/csm'>http://purl.org/censi/2007/csm</a>.</p>
-</body></html>
+</body>
+</html>