Related papers: Pentagon contact representations
Persistence diagrams, combining geometry and topology for an effective shape description used in pattern recognition, have already proven to be an effective tool for shape representation with respect to a certainfiltering function.…
Triangulation graph staining is sufficient for planar graph staining. This article will focus on triangulation and the nature of the color change channel of the staining tool. By construction, the four colors of the vertex are converted…
We formulate the pentagon relation for quantum dilogarithm elements in the structure group of a quantum cluster scattering diagram (QCSD). As an application, we show the nonpositivity of a certain class of nonskew-symmetric QCSDs. Also, we…
We construct $(2n+1)\times (2n+1)$ matrices corresponding to a motion of points on the plane from the point of view of Delaunay triangulations. We define a homomorphism from the pure braid group on ($n+3$) strands to the general linear…
A planar graph can be embedded in a piecewise linear manifold, and the lattice on each linear piece can be colored with 3-coloring. If a planar graph can be colored with multiple 3-coloring, i.e. coloring the graph in pieces with different…
In this paper, we consider the problem of determining in polynomial time whether a given planar point set $P$ of $n$ points admits 4-connected triangulation. We propose a necessary and sufficient condition for recognizing $P$, and present…
The detection and classification of intersections between triangles are crucial tasks in a wide range of applications within Computer Graphics and Geometry Processing, including mesh Arrangements, mesh Booleans, and generic mesh processing…
The persistence diagram (PD) is an increasingly popular topological descriptor. By encoding the size and prominence of topological features at varying scales, the PD provides important geometric and topological information about a space.…
It is a well-known fact that hamiltonicity in planar cubic graphs is an NP-complete problem. This implies that the existence of an A-trail in plane eulerian graphs is also an NP-complete problem even if restricted to planar 3-connected…
We consider the cross-modal task of producing color representations for text phrases. Motivated by the fact that a significant fraction of user queries on an image search engine follow an (attribute, object) structure, we propose a…
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…
We describe how hierarchical concepts can be represented in three types of layered neural networks. The aim is to support recognition of the concepts when partial information about the concepts is presented, and also when some of the…
Existing genetic programming (GP) methods are typically designed based on a certain representation, such as tree-based or linear representations. These representations show various pros and cons in different domains. However, due to the…
A contact map is a simple representation of the structure of proteins and other chain-like macromolecules. This representation is quite amenable to numerical studies of folding. We show that the number of contact maps corresponding to the…
Two immersed triangulations in the plane with the same combinatorics are considered as preimage and image of a discrete immersion $F$. We compare the cross-ratios $Q$ and $q$ of corresponding pairs of adjacent triangles in the two…
We provide a systematic enumerative and combinatorial study of geometric cellular diagonals on the permutahedra. In the first part of the paper, we study the combinatorics of certain hyperplane arrangements obtained as the union of $\ell$…
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…
To solve the combinatorial optimization problems especially the minimal Vertex-cover problem with high efficiency, is a significant task in theoretical computer science and many other subjects. Aiming at detecting the solution space of…
A graph $G=(V,E)$ is said to be word-representable if there exists a word $w$ over the alphabet $V$ such that two distinct letters $x,y\in V$ alternate in $w$ if and only if $xy \in E$. Word-representable graphs form a well-studied graph…
We use a growth procedure for binary trees due to Luczak and Winkler, a bijection between binary trees and irreducible quadrangulations of the hexagon due to Fusy, Poulalhon and Schaeffer, and the classical angular mapping between…