@inproceedings{Kaplan:2005:TA,
  opteditor = {},
  www = {http://www.cgl.uwaterloo.ca/~csk/papers/bridges2005b.html},
  optnote = {},
  optaddress = {},
  optorganization = {},
  author = {Craig S. Kaplan and Robert Bosch},
  optkey = {},
  optannote = {},
  optseries = {},
  url = {http://www.cgl.uwaterloo.ca/~csk/projects/tsp/},
  localfile = {papers/Kaplan.2005.TA.pdf},
  optpublisher = {},
  optmonth = {},
  optdoi = {},
  optcrossref = {},
  booktitle = {Proceedings of Bridges 2005, Mathematical Connections in Art,
               Music and Science},
  optstatus = {OK},
  optvolume = {},
  optnumber = {},
  title = {{TSP} {A}rt},
  abstract = {I Bosch and Herman recently described how to use the traveling
              salesman problem (TSP) to construct a continuous line drawing
              based on a user-supplied image. They create a distribution of
              cities that approximates the darkness of the source image, and
              pass the cities to a heuristic TSP solver. We discuss their method
              and present alternative algorithms for city distribution that
              yield more attractive line drawings.},
  year = {2005},
  pages = {},
}