English
Related papers

Related papers: Non-crossing frameworks with non-crossing reciproc…

200 papers

In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or…

Discrete Mathematics · Computer Science 2014-02-19 Patrizio Angelini , Giordano Da Lozzo , Giuseppe Di Battista , Fabrizio Frati , Maurizio Patrignani , Vincenzo Roselli

We extend the duality between acyclic orientations and totally cyclic orientations on planar graphs to dualities on graphs on orientable surfaces by introducing boundary acyclic orientations and totally bi-walkable orientations. In…

Combinatorics · Mathematics 2021-09-10 Woo-Seok Jung , Jaeseong Oh

We study the reflectional symmetry of a surface in the Euclidean 3-dimensional space with a cross-cap singularity with respect to planes. This symmetry is picked up by the singularities of folding maps on the cross-cap. We give a list of…

Differential Geometry · Mathematics 2020-04-13 Martín Barajas Sichacá

Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are…

Combinatorics · Mathematics 2012-08-13 Ron M. Adin , Yuval Roichman

Whitney proved that 3-connected planar graphs admit a unique embedding on the sphere. In contrast, Enami investigated embeddings of 3-connected cubic planar graphs on non-spherical surfaces with non-negative Euler characteristic. He…

Combinatorics · Mathematics 2026-05-25 Meike Weiß , Alice C. Niemeyer

Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is one in which each graph is drawn planar, there are no edge overlaps and the crossings between the two graphs form right angles. The…

Computational Geometry · Computer Science 2016-11-23 Michael A. Bekos , Thomas C. van Dijk , Philipp Kindermann , Alexander Wolff

A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and…

Computational Geometry · Computer Science 2025-01-22 Guilherme D. da Fonseca , Yan Gerard , Bastien Rivier

We consider phase coexistence and criticality in a thin-film Ising magnet with opposing surface fields and non-planar (corrugated) walls. We show that the loss of translational invariance has a strong and unexpected non-linear influence on…

Condensed Matter · Physics 2016-08-31 C. Rascon , A. O. Parry

We formulate and prove a periodic analog of Maxwell's theorem relating stressed planar frameworks and their liftings to polyhedral surfaces with spherical topology. We use our lifting theorem to prove deformation and rigidity-theoretic…

Metric Geometry · Mathematics 2015-01-16 Ciprian S. Borcea , Ileana Streinu

IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…

Computational Geometry · Computer Science 2016-07-19 Franz J. Brandenburg , Walter Didimo , William S. Evans , Philipp Kindermann , Giuseppe Liotta , Fabrizio Montecchiani

Recent work has shown that if an isostatic bar and joint framework possesses non-trivial symmetries, then it must satisfy some very simply stated restrictions on the number of joints and bars that are `fixed' by various symmetry operations…

Metric Geometry · Mathematics 2009-07-14 Bernd Schulze

A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…

Computational Geometry · Computer Science 2022-05-17 Walter Didimo , Michael Kaufmann , Giuseppe Liotta , Giacomo Ortali

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

Combinatorics · Mathematics 2020-07-21 Stefan Felsner , Clemens Huemer , Sarah Kappes , David Orden

In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each…

Computational Geometry · Computer Science 2017-03-07 Abu Reyan Ahmed , Felice De Luca , Sabin Devkota , Alon Efrat , Md Iqbal Hossain , Stephen Kobourov , Jixian Li , Sammi Abida Salma , Eric Welch

Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded…

Geometric Topology · Mathematics 2026-05-01 Teruo Nagase , Akiko Shima

A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is…

Computational Geometry · Computer Science 2007-08-08 Colm O Dunlaing

The CR analogue of B.-Y. Chen's conjecture on pseudo biharmonic maps will be shown. Pseudo biharmonic, but not pseudo harmonic, isometric immersions with parallel pseudo mean curvature vector fields, will be characterized. Several examples…

Differential Geometry · Mathematics 2014-10-02 Hajime Urakawa

We construct new examples of self-translating surfaces for the mean curvature flow from a periodic configuration with finitely many grim reaper cylinders in each period. Because this work is an extension of the author's article on the…

Differential Geometry · Mathematics 2014-07-04 Xuan Hien Nguyen

A pseudoline arrangement graph is a planar graph induced by an embedding of a (simple) pseudoline arrangement. We study the corresponding graph realization problem and properties of pseudoline arrangement graphs. In the first part, we give…

Combinatorics · Mathematics 2021-03-04 Sandip Das , Siddani Bhaskara Rao , Uma kant Sahoo

The paper is concerned with comparative analysis of differential and integral formulations for boundary value problems in nonlocal elasticity. For the sake of simplicity, the focus is on an antiplane problem for a half-space for an…

Analysis of PDEs · Mathematics 2021-07-22 Julius Kaplunov , Danila A Prikazchikov , Ludmila Prikazchikova
‹ Prev 1 3 4 5 6 7 10 Next ›