Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Snap Rounding

Computational Geometry Algorithm

Snap rounding is a method of approximating line segment locations by overlaying a grid and moving each point to the center of whichever grid cell, or pixel, it falls within. The technique preserves the important spatial relationships within a configuration of line segments while converting their coordinates to grid-aligned positions. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Connections

In Field

Source Wikipedia: Snap rounding
Sources
Wikipedia: Snap rounding
  • Lead section
    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.
  • In Group: Geometric Intersection, Proximity and Measurement Algorithms, Lead
    Snap rounding is a method of approximating line segment locations by creating a grid
  • In Field: Algorithms and Complexity Theory, Lead sentence
    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.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.