Representation of curves of constant width in the hyperbolic plane.
Araújo, P.V. (1998)
Portugaliae Mathematica
Similarity:
Araújo, P.V. (1998)
Portugaliae Mathematica
Similarity:
G. Bellettini, L. Mugnai (2004)
Annales de l'I.H.P. Analyse non linéaire
Similarity:
Tengely, Szabolcs (2007)
Annales Mathematicae et Informaticae
Similarity:
Geda, Gábor, Vágner, Anikó (2006)
Annales Mathematicae et Informaticae
Similarity:
Mohsen Madi (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
In applications such as CNC machining, highway and railway design, manufacturing industry and animation, there is a need to systematically generate sets of reference points with prescribed arclengths along parametric curves, with sufficient accuracy and real-time performance. Thus, mechanisms to produce a parameter set that yields the coordinates of the reference points along the curve Q(t) = {x(t), y(t)} are sought. Arclength parameterizable expressions usually yield a parameter set...
Jorge Cortés, Sonia Martínez, Francesco Bullo (2005)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing or communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed...
Fathali, Jafar, Zaferanieh, Mehdi, Nezakati, Ahmad (2009)
Advances in Operations Research
Similarity:
Ouafi, Rachid, Khelladi, Abdelkader (2009)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Düldül, Mustafa, Kuruoğlu, Nuri (2008)
Applied Mathematics E-Notes [electronic only]
Similarity:
Tuomo Valkonen, Tommi Kärkkäinen (2009)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
We consider continuous reformulations of the euclidean travelling salesperson problem (TSP), based on certain clustering problem formulations. These reformulations allow us to apply a generalisation with perturbations of the Weiszfeld algorithm in an attempt to find local approximate solutions to the euclidean TSP.