Related papers: On a class of linearizable planar geodesic webs

Finite (upper) nearlattices are essentially the same mathematical entities as finite semilattices, finite commutative idempotent semigroups, finite join-enriched meet semilattices, and chopped lattices. We prove that if an $n$-element…

In this paper we describe projective curves and surfaces such that almost all their hyperplane sections are projectively equivalent. Our description is complete for curves and close to being complete for smooth surfaces. In the appendix we…

introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…

Recursive modelling for the kinematics of a 3-PRP planar parallel robot is presented in this paper. Three planar chains connecting to the moving platform of the manipulator are located in a vertical plane. Knowing the motion of the…

A graph is IC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share no common end vertex. IC-planarity specializes both NIC-planarity, which allows a pair of crossing…

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

Supercyclides are surfaces with a characteristic conjugate parametrization consisting of two families of conics. Patches of supercyclides can be adapted to a Q-net (a discrete quadrilateral net with planar faces) such that neighboring…

We prove the existence of infinitely many low-lying and fundamental closed geodesics on the modular surface which are reciprocal, that is, invariant under time reversal. The method combines ideas from Parts I and II of this series, namely…

Planar graph drawings tend to be aesthetically pleasing. In this poster we explore a Neural Network's capability of learning various planar graph classes. Additionally, we also investigate the effectiveness of the model in generalizing…

Let $M$ be a geometrically finite acylindrical hyperbolic 3-manifold and let $M^*$ denote the interior of the convex core of M. We show that any geodesic plane in $M^*$ is either closed or dense, and that there are only countably many…

We show that there are five types of planar curves such that arrangements of its translates are combinatorially equivalent to an arrangement of lines. These curves can be used to define norms giving constructions with many unit distances…

We analyse properties of geometric intersection graphs to show the strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties: - A graph $G$ is outerplanar if and only…

In this note we study curves (arrangements) in the complex projective plane which can be considered as generalizations of free curves. We construct families of arrangements which are nearly free and possess interesting geometric properties.…

Recently, the second and third author showed that complete geometric graphs on $2n$ vertices in general cannot be partitioned into $n$ plane spanning trees. Building up on this work, in this paper, we initiate the study of partitioning into…

For fixed large genus, we construct families of complete immersed minimal surfaces in R3 with four ends and dihedral symmetries. The families exist for all large genus and at an appropriate scale degenerate to the plane.

We introduce a class of cusped hyperbolic $3$-manifolds that we call mixed-platonic, composed of regular ideal hyperbolic polyhedra of more than one type, which includes certain previously-known examples. We establish basic facts about…

The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…

It is shown how the well-known class of bihamiltonian structures in general position can be extended to a wider class. A generalization of the corresponding notion of a Veronese web for this wider class is presented (in the general position…

This note is about the geometry of the pants graph P(S), a natural simplicial graph associated to a finite type topological surface S where vertices represents pants decompositions. The main result in this note ascserts that for a…

We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…