Topological Drawings Meet Classical Theorems from Convex Geometry
نویسندگان
چکیده
In this article we discuss classic theorems from Convex Geometry in the context of topological drawings and beyond. a simple drawing complete graph $$K_n$$ , any two edges share at most one point: either common vertex or point where they cross. Triangles can be viewed as convex sets. This gives link to geometry. As our main result, present generalization Kirchberger’s theorem that is purely combinatorial nature. It turned out also applies “generalized signotopes”—a drawings, which introduce investigate course article. indicated by their name are signotopes, structure studied encodings for arrangements pseudolines. We family with arbitrarily large Helly number, new proof Carathéodory’s plane further drawings.
منابع مشابه
M-FUZZIFYING TOPOLOGICAL CONVEX SPACES
The main purpose of this paper is to introduce the compatibility of $M$-fuzzifying topologies and $M$-fuzzifying convexities, define an $M$-fuzzifying topological convex space, and give a method to generate an $M$-fuzzifying topological convex space. Some characterizations of $M$-fuzzifying topological convex spaces are presented. Finally, the notion of $M$-fuzzifying weak topologies is obtaine...
متن کاملConvex Solutions of Elliptic Differential Equations in Classical Differential Geometry
The issue of convexity is fundamental in the theory of partial differential equations. We discuss some recent progress of convexity estimates for solutions of nonlinear elliptic equations arising from some classical problems in differential geometry. We first review some works in the literature on the convexity of solutions of quasilinear elliptic equations in Rn. The study of geometric propert...
متن کاملOptimal Morphs of Convex Drawings
We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity. The linear bound is asymptotically optimal in the worst case. 1998 ACM Subject Classification G.2.2. Graph Theory
متن کاملConvex-Arc Drawings of Pseudolines
Introduction. A pseudoline is formed from a line by stretching the plane without tearing: it is the image of a line under a homeomorphism of the plane [13]. In arrangements of pseudolines, pairs of pseudolines intersect at most once and cross at their intersections. Pseudoline arrangements can be used to model sorting networks [1], tilings of convex polygons by rhombi [4], and graphs that have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2022
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-022-00408-6