Related papers: Drawing polytopal graphs with polymake
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
In this survey, we explore recent literature on finding the cores of higher graphs using geometric and topological means. We study graphs, hypergraphs, and simplicial complexes, all of which are models of higher graphs. We study the notion…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…
This paper is devoted to some rotationally symmetric classes of graphs denoted in literature as convex polytope graphs. Exact value of equidistant dimension is found for $T_n$. Next, for even $n$ exact values are found for $R''_n$ and…
We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…
High-dimensional data, characterized by many features, can be difficult to visualize effectively. Dimensionality reduction techniques, such as PCA, UMAP, and t-SNE, address this challenge by projecting the data into a lower-dimensional…
Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
For piecewise-linear maps the stable and unstable manifolds of hyperbolic periodic solutions are themselves piecewise-linear. Hence compact subsets of these manifolds can be represented using polytopes (i.e. polygons, in the case of…
This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polytopal realizations of products, whose connection is the problem of finding polytopal realizations of a given combinatorial structure. A…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings…
Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…
For certain tropical quartic curves the existing techniques could not predict the lifting behavior of their bitangents over the real numbers. We close this gap by using patchworking techniques. Further, this paper provides an analysis of…
Segmentation is often an essential intermediate step in image analysis. A volume segmentation characterizes the underlying volume image in terms of geometric information--segments, faces between segments, curves in which several faces…
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…
In this survey paper, we present open problems and conjectures on visibility graphs of points, segments and polygons along with necessary backgrounds for understanding them.