Document Open Access Logo

Snap Rounding: A Cautionary Tale

Author John Hershberger

PDF HTML 5

Files

Thumbnail PDF
PDF
LIPIcs.SoCG.2025.57.pdf
  • Filesize: 1.22 MB
  • 14 pages
HTML5 Logo HTML (experimental)
LIPIcs.SoCG.2025.57.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Software and its engineering → Designing software
  • Applied computing → Computer-aided design
Keywords
  • Snap rounding
  • implementation
  • computational geometry

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

This paper describes the author’s experience using and modifying the technique of snap rounding to meet the needs of a circuit verification system. The interplay of theory and practice illuminates the subtle challenges of both.

Cite As Get BibTex

John Hershberger. Snap Rounding: A Cautionary Tale. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 57:1-57:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SoCG.2025.57

Author Details

John Hershberger
  • Siemens EDA, Wilsonville, OR, USA

References

  1. J. L. Bentley and T. A. Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., C-28(9):643-647, September 1979. URL: https://doi.org/10.1109/TC.1979.1675432.
  2. M. de Berg, D. Halperin, and M. Overmars. An intersection-sensitive algorithm for snap rounding. Comp. Geom.: Theory and Appl., 36:159-165, 2007. URL: https://doi.org/10.1016/J.COMGEO.2006.03.002.
  3. W.-K. Chen, editor. The VLSI Handbook. CRC Press LLC, 2nd edition, 2006. Google Scholar
  4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2nd edition, 2001. Google Scholar
  5. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000. Google Scholar
  6. M. Goodrich, L. J. Guibas, J. Hershberger, and P. Tanenbaum. Snap rounding line segments efficiently in two and three dimensions. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 284-293, 1997. Google Scholar
  7. D. H. Greene. Integer line segment intersection. Unpublished Manuscript. Google Scholar
  8. L. J. Guibas and D. H. Marimont. Rounding arrangements dynamically. Int. J. Comp. Geometry & Appl., 8(2):157-176, 1998. URL: https://doi.org/10.1142/S0218195998000096.
  9. D. Halperin and E. Packer. Iterated snap rounding. Comp. Geom.: Theory and Appl., 23:209-225, 2002. URL: https://doi.org/10.1016/S0925-7721(01)00064-5.
  10. J. Hershberger. Improved output-sensitive snap rounding. Discr. Comput. Geom., 39:298-318, 2008. URL: https://doi.org/10.1007/S00454-007-9015-0.
  11. J. Hershberger. Stable snap rounding. Comp. Geom.: Theory and Appl., 46(4):403-416, 2013. http://dx.doi.org/10.1016/j.comgeo.2012.02.011. URL: https://doi.org/10.1016/J.COMGEO.2012.02.011.
  12. J. D. Hobby. Practical segment intersection with finite precision output. Comput. Geom. Theory Appl., 13(4):199-214, October 1999. URL: https://doi.org/10.1016/S0925-7721(99)00021-8.
  13. C. Mack. Fundamental Principles of Optical Lithography: The Science of Microfabrication. John Wiley and Sons, 2007. Google Scholar
  14. E. Packer. Iterated snap rounding with bounded drift. Comp. Geom.: Theory and Appl., 40(3):231-251, 2008. URL: https://doi.org/10.1016/J.COMGEO.2007.09.002.
  15. L. Scheffer, L. Lavagno, and G. Martin, editors. Electronic Design Automation for Integrated Circuits Handbook. Taylor & Francis, Boca Raton, Florida, 2006. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact