Results 221 to 230 of about 28,541 (252)

3D straight-line grid drawing of 4-colorable graphs

Information Processing Letters, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tiziana Calamoneri, Andrea Sterbini
exaly   +2 more sources

A Study on the Straight-Line Drawing Tasks for the Non-sighted People

Lecture Notes in Computer Science, 2007
A new ruler employs the finger touch to be the main pointing sensor with two locators at the two ends, and a unique pen in a smooth track to draw a line. The tasks of making straight line with two difference rulers (Ruler S: ruler used at school; Ruler C: new touch ruler) between non-sighted people (blindfolds and blinds) were observed: (1) free-line; (
Chih-Fu Wu, Cherng-Yee Leung, Yung-Hsiang Tu, Kuang-Chieh Hsu, Huei-Tang Lin   +4 more
exaly   +2 more sources

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

Algorithmica, 2005
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in CASE tools, software visualization and VLSI design. Drawing algorithms for hierarchical
Hiroshi Nagamochi, Xuemin Lin, Peter Eades   +2 more
exaly   +2 more sources

Line-drawing interpretation: straight lines and conic sections

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1988
Line drawings of man-made scenes often exhibit instances of straight lines and conic sections, i.e. ellipses, parabolas, and hyperbolas. Constraints imposed on the scene by such instances are investigated, under the assumption of general viewpoint, i.e.
exaly   +2 more sources

Finding straight lines in drawings

Proceedings of the Fourth International Conference on Document Analysis and Recognition, 2002
We have developed an efficient method to extract straight lines at any orientation from a line drawing. The method works by extracting the horizontal and vertical lines using the FAST method, detecting the angles of the other lines and applying the FAST method again while the image is rotated to each corresponding angle. The method is efficient because
Juan F. Arias, Atul K. Chhabra, Vishal Misra   +2 more
openaire   +1 more source

An Algorithm for Straight-Line Drawing of Planar Graphs

Algorithmica, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Harel, Meir Sardas
openaire   +2 more sources

Angular resolution of straight-line drawings (abstract)

ACM SIGACT News, 1993
An orthogonal drawing of a graph is such that the edges are represented by polygonal chains consisting of horizontal and vertical segments. The intermediate vertices of the chain (which are not vertices of the graph) are called bends. In this talk we survey algorithms for constructing planar orthogonal drawings.
openaire   +1 more source

Drawing straight lines with a pyramid cellular automaton

Information Processing Letters, 1982
This paper gives an efficient algorithm for drawing a straight line through two given points in a digitized picture, where the picture is stored one pixel per processor at the base of a pyramid cellular automaton (PCA). Dyer [l] defines a PCA to be a finite-state automaton which is replicated at each node of a finite, complete 4-ary tree, but for our ...
openaire   +1 more source

Straight-Line Monotone Grid Drawings of Series-Parallel Graphs

Discrete Mathematics, Algorithms and Applications, 2013
A monotone drawing of a planar graph G is a planar straight-line drawing of G where a monotone path exists between every pair of vertices of G in some direction. Recently monotone drawings of graphs have been discovered as a new standard for visualizing graphs.
Md. Iqbal Hossain 0001, Md. Saidur Rahman 0001   +1 more
openaire   +2 more sources

Density of straight-line 1-planar graph drawings

Information Processing Letters, 2013
A 1-planar drawing of a graph is such that each edge is crossed at most once. In 1997, Pach and Toth showed that any 1-planar drawing with n vertices has at most 4n-8 edges and that this bound is tight for n>=12. We show that, in fact, 1-planar drawings with n vertices have at most 4n-9 edges, if we require that the edges are straight-line segments. We
openaire   +1 more source