T. Biedl: The DFS-Heuristic for orthogonal graph drawing, Computational Geometry: Theory and Applications, 18, 2001, pp. 167-188.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... geographic information systems, computational geometry, computational morphology, and computer vision use the underlying structure (also referred to as the skeleton or internal shape) of a set of data points revealed by means of a proximity graph (see for example [24] 20] 8] 17] 25] [27], 1] A proximity graph attempts to exhibit the relation between points in a point set. Two points are joined by an edge if they are deemed close by some proximity measure. It is the measure that determines the type of graph that results. Many different measures of proximity have been defined. ....

....I 00198 Roma, Italia. This work has been done when this author was visiting the School of Computer Science of McGill University. liotta infokit.ing.uniroma1.it Other proximity graphs that have been studied are the fi skeleton [12] the sphere of influence graph [25] and the fl neighborhood graph [27]. An extensive survey on the current research in proximity graphs can be found in Jaromczyk and Toussaint [14] Much attention has been given over the past several years to developing algorithms for drawing graphs in the plane such that the resulting drawing has certain geometric properties. For ....

R. C. Vetkamp. The fl-Neighbourhood Graph. Computational Geometry: Theory and Applications,

.... analysis, geographic information systems, computational geometry, computational morphology, and computer vision use the underlying structure (also referred to as the skeleton or internal shape) of a set of data points revealed by means of a proximity graph (see for example [23] 28] 11] 19] [31] [1] 14] A proximity graph attempts to exhibit a relation between points in a point set by connecting pairs of points that are deemed close by some proximity measure. It is the measure that determines the type of graph that results. Many different measures of proximity have been defined. For ....

R. C. Vetkamp. The -Neighbourhood Graph. Computational Geometry: Theory and Applications, 1, 1992, pp. 227-246. 16

....Kirkpatrick and Radke [KR88] Up until now it has been assumed that the parameter fi, like ff, needs to be found by the user. For our reconstruction problem, we give a value for fi which is guaranteed to work when S meets the sampling condition. The fl neighborhood graph, introduced by Veltkamp [Vel92], is a generalization of the fi skeleton in which the two forbidden disks may have different radii. We believe that results similar to ours can be proved for a suitably defined family of fl neighborhood graphs, in which the angle between the two circles at the point of intersection (see ....

Veltkamp, R.C., The fl-neighborhood graph, Computational Geometry: Theory and Applications 1:4, (1992), pp. 227-246.

....application in drawing of trees with better aspect ratio. Fig 5 : A planar st graph and its orthogonal representation . 4. DFS HEURISTIC FOR ORTHOGONAL GRAPH DRAWING The DFS heuristic implements an algorithm for the orthogonal drawing of graphs, which is based on an algorithm, presented in [3]. This section describes the implementation issues and output of the software. 4.1 Algorithms used in the Implementation Numerous algorithms of various kinds were implemented during the implementation of the software. Here, we present the main algorithms used a) DFS The Depth first search is a ....

....along a vertical segment iv. else v. first assign the edge along a vertical segment and then along a horizontal segment d) Port Assignment The most important of all algorithms used. We present the algorithm here. For more details with theorems and explanations, one can refer to pages 10 12 of [3]. i. for i = 1. k do ii. if i = 1 then iii. Let e 1 , e 2 . e l be the incoming blue non tree edges of w1. iv. Sort e 1 , e 2 , e l by decreasing column of the bend of e j . v. In case of a tie, sort by decreasing row of endpoint = w 1 of e j . vi. Set r p = 1; vii. for j = ....

T. Biedl: The DFS-Heuristic for orthogonal graph drawing, Computational Geometry: Theory and Applications, 18, 2001, pp. 167-188.

No context found.

G. T'oth: The shortest distance among points in general position, Computational Geometry: Theory and Applications 7, (1997).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC