Related papers: Geodesic nets with three boundary vertices

Let $P$ be a set of $n$ points in $\mathbb{R}^3$ amid a bounded number of obstacles. When obstacles are axis-parallel boxes, we prove that $P$ admits an $8\sqrt{3}$-spanner with $O(n\log^3 n)$ edges with respect to the geodesic distance.

We consider a nonrelativistic quantum particle constrained to a curved layer of constant width built over a non-compact surface embedded in $R^3$. We suppose that the latter is endowed with the geodesic polar coordinates and that the layer…

A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…

We prove that every tetrahedron T has a simple, closed quasigeodesic that passes through three vertices of T. Equivalently, every T has a face whose "exterior angles" are at most pi.

The topology and symmetry group of a free boundary minimal surface in the three-dimensional Euclidean unit ball do not determine the surface uniquely. We provide pairs of non-isometric free boundary minimal surfaces having any sufficiently…

Using an explicit family of plane quartic curves, we prove the existence of a genus 3 curve over any finite field of characteristic 3 whose number of rational points stays within a fixed distance from the Hasse-Weil-Serre upper bound. We…

This paper completes the classification of nets of conics containing at least one double line in $\mathrm{PG}(2,q)$ for $q$ even. This classification contributes to the classification of partially symmetric tensors in $\mathbb{F}_q^3…

The surrounding of a vertex in a network can be more or less symmetric. We derive measures of a specific kind of symmetry of a vertex which we call degree symmetry -- the property that many paths going out from a vertex have overlapping…

We extend the geometric study of the Wasserstein space W(X) of a simply connected, negatively curved metric space X by investigating which pairs of boundary points can be linked by a geodesic, when X is a tree.

Necessary and sufficient conditions are obtained for the infinitesimal rigidity of braced grids in the plane with respect to non-Euclidean norms. Component rectangles of the grid may carry 0, 1 or 2 diagonal braces, and the combinatorial…

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…

In the present note we provide a partial classification of nearly free conic-line arrangements in the complex plane having nodes, tacnodes, and ordinary triple points. In this setting, our theoretical bound tells us that the degree of such…

In this note, we show that there exist cusped hyperbolic $3$-manifolds that embed geodesically, but cannot bound geometrically. Thus, being a geometric boundary is a non-trivial property for such manifolds. Our result complements the work…

We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…

The two-dimensional surface of a bi-axial ellipsoid is characterized by the lengths of its major and minor axes. Longitude and latitude span an angular coordinate system across. We consider the egg-shaped surface of constant altitude above…

We prove that for a Baire-generic Riemannian metric on a closed smooth manifold of dimension greater than or equal 3, the union of stationary geodesic nets that are not closed geodesics forms a dense set. This result confirms a…

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected…

In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…

This paper presents some finiteness results for the number of boundary slopes of immersed essential surfaces of given genus g in a compact 3-manifold with torus boundary. In the case of hyperbolic 3-manifolds we obtain uniform quadratic…