Computing the topology of a plane or space hyperelliptic curve

International audienceWe present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose topology is easy to compute, under a birational mapping of the plane or the space. We report on a Maple implementation of these algorithms, and present several examples. Complexity and certification issues are also discussed

Piecewise rational approximation of square-root parameterizable curves using the Weierstrass form

In this paper we study situations when non-rational parameterizations of planar or space curves as results of certain geometric operations or constructions are obtained, in general. We focus especially on such cases in which one can identify a rational mapping which is a double cover of a rational curve. Hence, we deal with rational, elliptic or hyperelliptic curves that are birational to plane curves in the Weierstrass form and thus they are square-root parameterizable. We design a simple algorithm for computing an approximate (piecewise) rational parametrization using topological graphs of the Weierstrass curves. Predictable shapes reflecting a number of real roots of a univariate polynomial and a possibility to approximate easily the branches separately play a crucial role in the approximation algorithm. Our goal is not to give a comprehensive list of all such operations but to present at least selected interesting cases originated in geometric modelling and to show a unifying feature of the formulated method. We demonstrate our algorithm on a number of examples

Analogue filter networks: developments in theory, design and analyses

Not availabl

Tools and Algorithms for the Construction and Analysis of Systems

This book is Open Access under a CC BY licence. The LNCS 11427 and 11428 proceedings set constitutes the proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019. The total of 42 full and 8 short tool demo papers presented in these volumes was carefully reviewed and selected from 164 submissions. The papers are organized in topical sections as follows: Part I: SAT and SMT, SAT solving and theorem proving; verification and analysis; model checking; tool demo; and machine learning. Part II: concurrent and distributed systems; monitoring and runtime verification; hybrid and stochastic systems; synthesis; symbolic verification; and safety and fault-tolerant systems