GGGeorg Grasegger

Georg Grasegger

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Georg Grasegger has a total of 37 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Constructing reflection-symmetric flexible realisations of graphs

    by Sean Dewar, Georg Grasegger, Jan Legerský

    AMC is a journal published by University of Primorska.

  • Open Access

    PyRigi — a general-purpose Python package for the rigidity and flexibility of bar-and-joint frameworks

    by Matthias Adrian-Himmelmann, Matteo Gallet, Georg Grasegger, Jan Legerský

    We present PyRigi , a novel Python package designed to study the rigidity properties of graphs and frameworks. Among many other capabilities, PyRigi can determine whether a graph admits only finitely many ways, up to isometries, of placing the vertices in the plane so that the corresponding edge lengths are not altered, it can check whether the graph satisfies such a property even after the removal of any of its edges, and whether is has a unique vertex placement. By implementing algorithms from the scientific literature, PyRigi enables the exploration of rigidity properties of structures that would be out of reach for computations by hand. With reliable and robust algorithms, as well as clear, well-documented methods that are closely connected to the underlying mathematical definitions and results, PyRigi aims to be a practical and powerful general-purpose tool for the working mathematician interested in rigidity theory. PyRigi is open source and easy to use, and awaits researchers to benefit from its computational potential.


  • Open Access

    Single-cell 3D genome reconstruction in the haploid setting using rigidity theory

    by Sean Dewar, Georg Grasegger, Kaie Kubjas, Fatemeh Mohammadi, Anthony Nixon

    This article considers the problem of 3-dimensional genome reconstruction for single-cell data, and the uniqueness of such reconstructions in the setting of haploid organisms. We consider multiple graph models as representations of this problem, and use techniques from graph rigidity theory to determine identifiability. Biologically, our models come from Hi-C data, microscopy data, and combinations thereof. Mathematically, we use unit ball and sphere packing models, as well as models consisting of distance and inequality constraints. In each setting, we describe and/or derive new results on realisability and uniqueness. We then propose a 3D reconstruction method based on semidefinite programming and apply it to synthetic and real data sets using our models.

  • Open Access

    On the uniqueness of collections of pennies and marbles

    by Sean Dewar, Georg Grasegger, Kaie Kubjas, Fatemeh Mohammadi, Anthony Nixon


  • Open Access

    Constructing reflection-symmetric flexible realisations of graphs

    by Sean Dewar, Georg Grasegger, Jan Legerský

    We study reflection-symmetric realisations of symmetric graphs in the plane that allow a continuous symmetry and edge-length preserving deformation. To do so, we identify a necessary combinatorial condition on graphs with reflection-symmetric flexible realisations. This condition is based on a specific type of edge colouring, where edges are assigned one of three colours in a symmetric way. From some of these colourings we also construct concrete reflection-symmetric realisations with their corresponding symmetry preserving motion. We study also a specific class of reflection-symmetric realisations consisting of triangles and parallelograms.

  • Open Access

    Quotient graphs of symmetrically rigid frameworks

    by Sean Dewar, Georg Grasegger, Eleftherios Kastis, Anthony Nixon

    A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in \mathbb{R}^{d} that admit some non-trivial symmetry. When d=2 there is a large literature on this topic. In particular, it is typical to quotient the symmetric graph by the group and analyse the rigidity of symmetric, but otherwise generic frameworks, using the combinatorial structure of the appropriate group-labelled quotient graph. However, mirroring the situation for generic rigidity, little is known combinatorially when d\geq 3 . Nevertheless in the periodic case, a key result of Borcea and Streinu in 2011 characterises when a quotient graph can be lifted to a rigid periodic framework in \mathbb{R}^{d} . We develop an analogous theory for symmetric frameworks in \mathbb{R}^{d} . The results obtained apply to all finite and infinite 2-dimensional point groups, and then in arbitrary dimension they concern a wide range of infinite point groups, sufficiently large finite groups and groups containing translations and rotations. For the case of finite groups we also derive results concerning the probability of assigning group labels to a quotient graph so that the resulting lift is symmetrically rigid in \mathbb{R}^{d} . The submission date of this paper had been incorrectly displayed on the web page between 8 May 2024 and 5 June 2025. For the details, see the .


  • Open Access

    Rigidity of nearly planar classes of graphs

    by Sean Dewar, Georg Grasegger, Eleftherios Kastis, Anthony Nixon, Brigitte Servatius

    We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic 3-dimensional rigidity matroid adding to the short list of graph classes for which 3-dimensional rigidity is understood. We then analyse global rigidity for these graph classes and use our results to deduce bounds on the maximum likelihood threshold of graphs in these nearly planar classes.

  • Open Access

    The number of realisations of a rigid graph in Euclidean and spherical geometries

    by Sean Dewar, Georg Grasegger

    A graph is $d$-rigid if for any generic realisation of the graph in $\mathbb{R}^d$ (equivalently, the $d$-dimensional sphere $\mathbb{S}^d$), there are only finitely many non-congruent realisations in the same space with the same edge lengths. By extending this definition to complex realisations in a natural way, we define $c_d(G)$ to be the number of equivalent $d$-dimensional complex realisations of a $d$-rigid graph $G$ for a given generic realisation, and $c^*_d(G)$ to be the number of equivalent $d$-dimensional complex spherical realisations of $G$ for a given generic spherical realisation. Somewhat surprisingly, these two realisation numbers are not always equal. Recently developed algorithms for computing realisation numbers determined that the inequality $c_2(G) \leq c_2^*(G)$ holds for any minimally 2-rigid graph $G$ with 12 vertices or less. In this paper we confirm that, for any dimension $d$, the inequality $c_d(G) \leq c_d^*(G)$ holds for every $d$-rigid graph $G$. This result is obtained via new techniques involving coning, the graph operation that adds an extra vertex adjacent to all original vertices of the graph.

  • Open Access

    Calligraphs and sphere realizations

    by Matteo Gallet, Georg Grasegger, Niels Lubbes, Josef Schicho

    We introduce a recursive procedure for computing the number of realizations of a minimally rigid graph on the sphere up to rotations. We accomplish this by combining two ingredients. The first is a framework that allows us to think of such realizations as of elements of a moduli space of stable rational curves with marked points. The second is the idea of splitting a minimally rigid graph into two subgraphs, called calligraphs, that admit one degree of freedom and that share only a single edge and a further vertex. This idea has been recently employed for realizations of graphs in the plane up to isometries. The key result is that we can associate to a calligraph a triple of natural numbers with a special property: whenever a minimally rigid graph is split into two calligraphs, the number of realizations of the former equals the product of the two triples of the latter, where this product is specified by a fixed quadratic form. These triples and quadratic form codify the fact that we express realizations as intersections of two curves on the blowup of a sphere along two pairs of complex conjugate points.