Show simple item record

dc.contributorHuemer, Clemens
dc.contributor.authorZheng, Shutao
dc.date.accessioned2016-07-27T10:53:49Z
dc.date.available2016-07-27T10:53:49Z
dc.date.issued2016-07-26
dc.identifier.urihttp://hdl.handle.net/2117/89260
dc.description.abstractThe thesis is dedicated to find a fast Monte Carlo algorithm for the calculation of the rectilinear crossing number Cr(S) of a point set S in the plane, where Cr(S) is the number of intersections of all the straight line segments which connect pairs of points of the set. Crossing numbers are a central topic of research in the area of Discrete and Computational Geometry. A quadratic time algorithm to calculate Cr(S) is known, which, for large input size, is very time-consuming. We propose fast Monte Carlo algorithms to produce approximate solutions. To our knowledge, Monte Carlo methods have not been applied before in this setting. There is a trade-off between the precision of the approximated crossing number and the running time of the Monte Carlo algorithm. Since the outputs of Monte Carlo methods follow a normal distribution when the samples are independent, the exactitude of a Monte Carlo method is related with the variance. If the variance is smaller, the required sample size to reach a predefined precision of the solution (with high probability) will be smaller and the exactitude will be higher. In this thesis we introduce six Monte Carlo methods for the calculation of the rectilinear crossing number, and study their variances and the required sample sizes. Computational experiments confirm the obtained theoretical results. Also, we apply some variance reduction techniques, such as importance sampling, antithetic variates, and control variates, to enhance the performance of the developed Monte Carlo methods. The best reduction technique in this thesis is the control variates technique which reduces the required sample size significantly compared to the original method.
dc.language.isoeng
dc.publisherUniversitat Politècnica de Catalunya
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Estadística matemàtica
dc.subject.lcshMonte Carlo method
dc.subject.otherAlgorisme Monte Carlo
dc.subject.otherGeometria combinatòria
dc.subject.otherRectilinear Crossing Number
dc.titleMonte carlo methods for the rectilinear crossing number
dc.typeBachelor thesis
dc.subject.lemacMontecarlo, Mètode de
dc.rights.accessOpen Access
dc.date.updated2016-07-27T06:48:55Z
dc.audience.educationlevelEstudis de primer/segon cicle
dc.audience.mediatorEscola d'Enginyeria de Telecomunicació i Aeroespacial de Castelldefels
dc.audience.degreeGRAU EN ENGINYERIA D'AERONAVEGACIÓ (Pla 2010)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-ShareAlike 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-ShareAlike 3.0 Spain