Given a fixed origin <i>o</i> in the <i>d</i>-dimensional grid, we give a novel definition of <i>digital rays dig(op)</i> from <i>o</i> to each grid point <i>p</i>. Each digital ray dig(<i>op</i>) approximates the Euclidean line segment <i>op</i> between <i>o</i> and <i>p</i>. The set of all digital rays satisfies a set of axioms analogous to the Euclidean… (More)
We consider the optimization problem of finding nonintersecting rectangles and tableaux in Ò ¢ Ò pixel plane where each pixel has a real valued weight. We discuss existence of efficient algorithms if a corner point of each rectangle/tableau is specified.