Discrete Lines and Wandering Paths

  • A. Vince
  • Published 2007 in SIAM J. Discrete Math.


The problem of finding an approximation to a geometric line by a discrete line using pixels is ubiquitous in computer graphics applications. We show that this discrete line problem in R n+1, for grids of any shape, is equivalent to a geometry problem in Rn concerning the minimization of the distance that a certain type of closed polygonal path wanders from… (More)
DOI: 10.1137/050642009


6 Figures and Tables