Snap rounding

<h2 id="algorithm">Algorithm</h2>
<h2 id="properties">Properties</h2>
<ul><li>Canonicity:</li>
<li>Efficiency;  A number of efficient implementations exist.</li></ul>
<p>Conversely there are undesirable properties:
</p>
<ul><li>Non-<a href="/facts/Idempotence/khbSpexv">idempotence</a>: Repeated applications can cause arbitrary drift of points.</li></ul>

<h2 id="bibliography">Bibliography</h2>
<ul><li>L. J. Guibas; D. H. Marimont (1998). "Rounding arrangements dynamically". <i>Int. J. Comput. Geom. Appl</i>. 8 (2): 157–176. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1142%2FS0218195998000096">10.1142/S0218195998000096</a>.</li></ul>
<h2 id="external-links">External links</h2>
<ul><li><a href="http://cccg.ca/proceedings/2007/07a1full.pdf">Efficient Snap-Rounding with Integer Arithmetic</a>, Binay K. Bhattacharya and Jeff Sember</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Csaba D. Toth; Joseph O'Rourke; Jacob E. Goodman (13 April 2004). Handbook of Discrete and Computational Geometry, Second Edition. CRC Press. pp. 552–. ISBN 978-1-4200-3531-5. <a href="978-1-4200-3531-5" target="_blank">978-1-4200-3531-5</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
</ol>

Snap rounding open-in-new

Snap rounding