Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Capco, Jose"'
Autor:
Salunkhe, Durgesh Haribhau, Spartalis, Christoforos, Capco, Jose, Chablat, Damien, Wenger, Philippe
Publikováno v:
Mechanism and Machine Theory, Elsevier, 2022, 171, pp.104729
Cuspidal robots can travel from one inverse kinematic solution to another without meeting a singularity. The name cuspidal was coined based on the existence of a cusp point in the workspace of 3R serial robots. The existence of a cusp point was prove
Externí odkaz:
http://arxiv.org/abs/2202.08686
Publikováno v:
ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Jul 2020, Kalamata Greece, France. pp.62-69
Answering connectivity queries in semi-algebraic sets is a long-standing and challenging computational issue with applications in robotics, in particular for the analysis of kinematic singularities. One task there is to compute the number of connecte
Externí odkaz:
http://arxiv.org/abs/2008.13392
We develop an algorithm that solves the inverse kinematics of general serial 2RP3R, 2R2P2R, 3RP2R and 6R manipulators based on the HuPf algorithm. We identify the workspaces of the 3-subchains of the manipulator with a quasi-projective variety in $\m
Externí odkaz:
http://arxiv.org/abs/1906.07813
Autor:
Capco, Jose, Scheiderer, Claus
Publikováno v:
Algebra, Logic and Number Theory (eds P. Gladki et al), Banach Center Publications vol. 121, Warszawa 2020, pp 25-36
There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient totally ima
Externí odkaz:
http://arxiv.org/abs/1905.13282
Publikováno v:
In Journal of Symbolic Computation March-April 2023 115:320-345
Autor:
Spartalis, Christoforos, Capco, Jose
Publikováno v:
In Computer Aided Geometric Design November 2022 99
Autor:
Capco, Jose, Gallet, Matteo, Grasegger, Georg, Koutschan, Christoph, Lubbes, Niels, Schicho, Josef
Publikováno v:
Electronic Notes in Discrete Mathematics (Proceedings of Eurocomb 2017) 61, pp. 207-213, 2017
Laman graphs model planar frameworks which are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. In a recent paper we provide a recursion formula for t
Externí odkaz:
http://arxiv.org/abs/1707.03633
Autor:
Capco, Jose, Gallet, Matteo, Grasegger, Georg, Koutschan, Christoph, Lubbes, Niels, Schicho, Josef
Publikováno v:
SIAM Journal on Applied Algebra and Geometry, Volume 2, Issue 1, p. 94-125, 2018
Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of systems o
Externí odkaz:
http://arxiv.org/abs/1701.05500
Autor:
Capco, Jose
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also make some
Externí odkaz:
http://arxiv.org/abs/0906.0282
Autor:
Capco, Jose
It was pointed out in my last paper that there are rings whose real closure * are not unique. In [4] we also discussed some example of rings by which there is a unique real closure * (mainly the real closed rings). Now we want to determine more class
Externí odkaz:
http://arxiv.org/abs/0710.0267