doi:10.1016/j.comgeo.2020.101653engBiniaz, AhmadGarcía, AlfredoPacking plane spanning trees into a point setART-2020-118264Let P be a set of n points in the plane in general position. We show that at least ¿n/3¿ plane spanning trees can be packed into the complete geometric graph on P. This improves the previous best known lower bound O(n). Towards our proof of this lower bound we show that the center of a set of points, in the d-dimensional space in general position, is of dimension either 0 or d.2020http://zaguan.unizar.es/record/10151210.1016/j.comgeo.2020.101653http://zaguan.unizar.es/record/101512oai:zaguan.unizar.es:101512info:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECTThis project has received funding from the European Union’s Horizon 2020 research and innovation program under grant agreement No H2020 734922-CONNECTinfo:eu-repo/grantAgreement/ES/MINECO/MTM2015-63791-RComputational Geometry: Theory and Applications 90 (2020), 101653 [5 pp.]by-nc-ndhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccess