J. D. Hobby. Space-efficient outlines from image data via vertex minimization and grid constraints. CVGIP: Graphical Models and Image Processing, 59(2), 1997. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
On the bit complexity of minimum link paths: Superquadratic.. - Kahan, Snoeyink (1998) (4 citations) (Correct)
....increases its complexity by a logarithmic factor, which is tight. We also look briefly at the algorithmic issues involved. These are closely related to rounding techniques for robust handling of arrangements of line segments, although we ask slightly different questions. See papers by Hobby [11, 12, 13], Milenkovic [17, 18, 19, 20] and Guibas et al. 7, 8] for more on arrangements of segments. 2 Exact minimum link paths Under the real RAM model of computation, a minimum link path from s to t in P can be computed by a simple greedy algorithm. We let (P; s; t) denote the number of links in ....
J. D. Hobby. Space-efficient outlines from image data via vertex minimization and grid constraints. CVGIP: Graphical Models and Image Processing, 59(2), 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC