Efficient geodesics and an effective algorithm for distance in the complex of curves
Type de record:
papersoftware
Créateur:
BirMarMen
Hôte:
We give an algorithm for determining the distance between two vertices of the complex of curves. While there already exist such algorithms, for example by Leasure, Shackleton, and Webb, our approach is new, simple, and more effective for all distances accessible by computer. Our method gives a new preferred finite set of geodesics between any two vertices of the complex, called efficient geodesics, which are different from the tight geodesics introduced by Masur and Minsky. 27 pages, 14 figures; greatly improved algorithm for distance, new examples distinguishing efficient geodesics from tight geodesics
Similaires
An AHP Algorithm for an Effective ERP Type Selection Based on the African ContextDILAND: An Algorithm for Distributed Sensor Localization with Noisy Distance MeasurementsAn Intelligent Cardiac Ailment Prediction Using Efficient ROCK Algorithm and K- Means & C4.5 AlgorithmRenewable Energy Resources Hybridization as an Efficient and Cost-Effective Alternative for ElectrificationDeveloping an Efficient and Effective Social Security Adjudication Framework in South AfricaDistance training for physics teachers in education sciences: flexible and efficient