Thick non-crossing paths and minimum-cost flows in polygonal domains

Valentin Polishchuk, Joseph S. B. Mitchell. Thick non-crossing paths and minimum-cost flows in polygonal domains. In Jeff Erickson, editor, Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007. pages 56-65, ACM, 2007. [doi]

@inproceedings{PolishchukM07,
  title = {Thick non-crossing paths and minimum-cost flows in polygonal domains},
  author = {Valentin Polishchuk and Joseph S. B. Mitchell},
  year = {2007},
  doi = {10.1145/1247069.1247079},
  url = {http://doi.acm.org/10.1145/1247069.1247079},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/PolishchukM07},
  cites = {0},
  citedby = {0},
  pages = {56-65},
  booktitle = {Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007},
  editor = {Jeff Erickson},
  publisher = {ACM},
  isbn = {978-1-59593-705-6},
}