Minimum Convex Partitions and Maximum Empty Polytopes. Dumitrescu, A., Har-Peled, S., & Tóth, C. D. In Proceedings of Scandinavian Workshop on Algorithm Theory (SWAT), pages 213-224, 2012.
Minimum Convex Partitions and Maximum Empty Polytopes [link]Paper  bibtex   
@inproceedings{ dblp2631930,
  title = {Minimum Convex Partitions and Maximum Empty Polytopes},
  author = {Adrian Dumitrescu and Sariel Har-Peled and Csaba D. Tóth},
  author_short = {Dumitrescu, A. and Har-Peled, S. and Tóth, C. D.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2012},
  key = {dblp2631930},
  id = {dblp2631930},
  biburl = {http://www.dblp.org/rec/bibtex/conf/swat/DumitrescuHT12},
  url = {http://dx.doi.org/10.1007/978-3-642-31155-0_19},
  conference = {SWAT},
  pages = {213-224},
  text = {SWAT 2012:213-224},
  booktitle = {Proceedings of Scandinavian Workshop on Algorithm Theory (SWAT)}
}

Downloads: 0