Related papers: Aspect Ratio Universal Rectangular Layouts
For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…
A \emph{thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once, either at a common end vertex or in a proper crossing. Conway's thrackle conjecture states that the number of edges is at most the number of…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
A graph $G$ is \emph{nonsingular (singular)} if its adjacency matrix $A(G)$ is nonsingular (singular). In this article, we consider the nonsingularity of block graphs, i.e., graphs in which every block is a clique. Extending the problem, we…
Segmentation display plays a vital role to display numerals. But in today's world matrix display is also used in displaying numerals. Because numerals has lots of curve edges which is better supported by matrix display. But as matrix…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of…
We study the geometry of surfaces in $\mathbb R^5$ by relating it to the geometry of regular and singular surfaces in $\mathbb R^4$ obtained by orthogonal projections. In particular, we obtain relations between asymptotic directions, which…
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…
The ruled surfaces, i.e., surfaces generated by one parametric set of lines, are widely used in the~field of applied geometry. An~isophote on a surface is a curve consisting of surface points whose normals form a constant angle with some…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We address the issue of angular measure, which is a contested issue for the International System of Units (SI). We provide a mathematically rigorous and axiomatic presentation of angular measure that leads to the traditional way of…
In this paper \emph{analytic equivalence} of geometric transition is defined in such a way that equivalence classes of geometric transitions turn out to be the \emph{arrows} of the \cy web. Then it seems natural and useful, both from the…
Mesh adaptation for finite element approximation is a procedure used in numerous applications. The use of thin and long anisotropic triangles improves the efficiency of the procedure. When piecewise linear finite elements are used, the…
Graphs are a natural representation for systems based on relations between connected entities. Combinatorial optimization problems, which arise when considering an objective function related to a process of interest on discrete structures,…
In a geometric graph, $G$, the \emph{stretch factor} between two vertices, $u$ and $w$, is the ratio between the Euclidean length of the shortest path from $u$ to $w$ in $G$ and the Euclidean distance between $u$ and $w$. The \emph{average…
Linear Geometry describes geometric properties that depend on the fundamental notion of a line. In this paper we survey basic notions and results of Linear Geomery that depend on the flat hulls: flats, exchange, rank, regularity,…
Assembling parts into an object is a combinatorial problem that arises in a variety of contexts in the real world and involves numerous applications in science and engineering. Previous related work tackles limited cases with identical unit…
This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…
We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number…