2017-03-012017-03-012004Aichholzer, O. y Reinhardt, K. (2004). A quadratic distance bound on sliding between crossing-free spanning trees. En 20th European Workshop on Computational Geometry, Sevilla.http://hdl.handle.net/11441/54977Let S be a set of n points in the plane and let TS be the set of all crossing-free spanning trees of S. We show that any two trees in TS can be transformed into each other by O(n2) local and constant-size edge slide operations. No polynomial upper bound for this task has been known, but in O.Aichholzer, F.Aurenhammer, F.Hurtado Sequences of spanning trees and a fixed tree theorem. Computational Geometry: Theory and Applications, 21(1-2):3-20, 2002. a bound of O(n2 log n) operations was conjectured.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/Crossing-free spanning treeLocal transformationEdge slideinfo:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccess