Results 221 to 230 of about 117,345 (255)

Planar straight-line point-set embedding of trees with partial embeddings

Information Processing Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alireza Bagheri, Mohammadreza Razzazi
exaly   +2 more sources

2-colored point-set embeddings of partial 2-trees

Theoretical Computer Science, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Di Giacomo E., Hancl J., Liotta G.
openaire   +3 more sources

Lattice Embeddings of Planar Point Sets

Discrete & Computational Geometry, 2016
Let \(\mathcal{M}\) be a non-collinear point set in the complex plane with \(|\mathcal{M}| \geq 3\) and such that for any two points \(\alpha, \beta \in \mathcal{M}\) we have \(|\alpha - \beta |^{2} \in \mathbb{Z}\). Since the norm of a complex number is the square of its length, we call \(\mathcal{M}\) an integer norm point set.
Michael Knopf, Jesse Milzman, Derek Smith, Dantong Zhu, Dara Zirlin   +4 more
openaire   +1 more source

Fewer bends point-set embedding with mapping [PDF]

International Conference on Electrical & Computer Engineering (ICECE 2010), 2010
An upward point-set embedding of an upward planar digraph G on a set of points S with a mapping Φ : V(G) → S is an upward planar drawing Γ of G where each vertex of G is placed on a point of S according to Φ. Γ is called an upward topological book embedding of G with the mapping Φ if the points in S are aligned along a straight-line.
Md Saidur Rahman
exaly   +2 more sources

Embedding Point Sets into Plane Graphs of Small Dilation

International Journal of Computational Geometry & Applications, 2005
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the circle, this question seems hard to answer; it is not even clear if there exists a lower bound > 1.
Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas   +5 more
openaire   +1 more source

Constrained Point Set Embedding of a Balanced Binary Tree

International Journal of Foundations of Computer Science, 2015
Given an undirected planar graph G with n vertices and a set S of n points inside a simple polygon P, a point-set embedding of G on S is a planar drawing of G such that each vertex is mapped to a distinct point of S and the edges are polygonal chains surrounded by P. A special case of the embedding problem is that in which G is a balanced binary tree.
Fatemeh Rajabi-Alni, Alireza Bagheri
openaire   +2 more sources

Optimal point-set embedding of wheel graphs and a sub-class of 3-trees

Japan Journal of Industrial and Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alireza Bagheri, Bagheri Alireza
exaly   +2 more sources

Upward Straight-Line Embeddings of Directed Graphs into Point Sets

2008
In this paper we consider the problem of characterizing the directed graphs that admit an upward straight-line embedding into every point set in convex or in general position. In particular, we show that no biconnected directed graph admits an upward straight-line embedding into every point set in convex position, and we provide a characterization of ...
Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov   +2 more
openaire   +2 more sources