Snap rounding

Snap rounding is a method of approximating line segment locations by creating a grid and placing each point in the centre of a cell (pixel) of the grid. The method preserves certain topological properties of the arrangement of line segments.

Drawbacks include the potential interpolation of additional vertices in line segments (lines become polylines), the arbitrary closeness of a point to a non-incident edge, and arbitrary numbers of intersections between input line-segments. The 3 dimensional case is worse, with a polyhedral subdivision of complexity n becoming complexity O(n4).

There are more refined algorithms to cope with some of these issues, for example iterated snap rounding guarantees a "large" separation between points and non-incident edges.[1]

Algorithm

... (please edit). See,[2] [3] and https://www.cgal.org/ ([4][5])

Properties

  • Canonicity:
  • Efficiency; A number of efficient implementations exist.

Conversely there are undesirable properties:

See also

References

  1. ^ 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.
  2. ^ L. J. Guibas; D. H. Marimont (1998). "Rounding arrangements dynamically". Int. J. Comput. Geom. Appl. 8 (2): 157–176. doi:10.1142/S0218195998000096.
  3. ^ Efficient Snap-Rounding with Integer Arithmetic, Binay K. Bhattacharya and Jeff Sember
  4. ^ CGAL Guide https://doc.cgal.org/latest/Snap_rounding_2/index.html
  5. ^ CGAL Implementation https://doc.cgal.org/latest/Snap_rounding_2/group__PkgSnapRounding2Ref.html


Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by adding missing information.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.