Guoyi Chi, KengLiang Loi, Pongsak Lasang. An Efficient Method to Find a Triangle with the Least Sum of Distances from Its Vertices to the Covered Point. In Ming Liu 0001, Haoyao Chen, Markus Vincze, editors, Computer Vision Systems - 11th International Conference, ICVS 2017, Shenzhen, China, July 10-13, 2017, Revised Selected Papers. Volume 10528 of Lecture Notes in Computer Science, pages 626-639, Springer, 2017. [doi]
@inproceedings{ChiLL17, title = {An Efficient Method to Find a Triangle with the Least Sum of Distances from Its Vertices to the Covered Point}, author = {Guoyi Chi and KengLiang Loi and Pongsak Lasang}, year = {2017}, doi = {10.1007/978-3-319-68345-4_55}, url = {https://doi.org/10.1007/978-3-319-68345-4_55}, researchr = {https://researchr.org/publication/ChiLL17}, cites = {0}, citedby = {0}, pages = {626-639}, booktitle = {Computer Vision Systems - 11th International Conference, ICVS 2017, Shenzhen, China, July 10-13, 2017, Revised Selected Papers}, editor = {Ming Liu 0001 and Haoyao Chen and Markus Vincze}, volume = {10528}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-319-68345-4}, }