A better heuristic for orthogonal graph drawings

Biedl, Thérèse; Kant, Goos

doi:10.1007/bfb0049394

Cited by 110 publications

(177 citation statements)

References 11 publications

Supporting

Mentioning

174

Contrasting

Unclassified

Order By: Relevance

“…We use this constant gadget size as our unit size. The literals, crossovers, and their connecting lines can be laid out orthogonally on an O(n + m) × O(n + m) unit square grid in polynomial time [BK94]. We may then need to tweak some of the path distances to have the same optimal traversal times.…”

Section: Putting Gadgets Togethermentioning

confidence: 99%

Mario Kart Is Hard

Bosboom¹,

Demaine²,

Hesterberg³

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Nintendo's Mario Kart is perhaps the most popular racing video game franchise. Players race alone or against opponents to finish in the fastest time possible. Players can also use items to attack and defend from other racers. We prove two hardness results for generalized Mario Kart: deciding whether a driver can finish a course alone in some given time is NP-hard, and deciding whether a player can beat an opponent in a race is PSPACE-hard.

show abstract

Section: Putting Gadgets Togethermentioning

confidence: 99%

Mario Kart Is Hard

Bosboom¹,

Demaine²,

Hesterberg³

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The area and bend bounds are higher than the best known [1,2,14,15], but we have to consider that this is a scheme that gives the user a lot of flexibility in inserting any node at any time. Moreover, any insertion takes place without disturbing the current drawing, since the insertion is built around it.…”

Section: Every Edge Has At Most Three Bends 3 the Total Number Of Bmentioning

confidence: 99%

“…The area required is 2n x 2n. A better algorithm is presented in [1] and [2], which draws the graph within an n x n grid with no more than two bends per edge. This algorithm introduces at most 2n + 2 bends.…”

Section: Introductionmentioning

confidence: 99%

Issues in interactive orthogonal graph drawing (preliminary version)

Papakostas

Tollis

1996

Graph Drawing

View full text Add to dashboard Cite

Abstract. Several applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing gives the user the ability to dynamically interact with the drawing. In this paper we discuss features that are essential for an interactive drawing system. We also describe some possible interactive drawing scenaria and present results on two of them. In these results we assume that the underline drawing is always orthogonal and the maximum degree of any vertex is at most four at the end of any update operation.

show abstract

“…Various algorithms have been introduced to produce orthogonal drawings of planar graphs [18,2,20,19,4]. A necessary and sufficient condition for a plane graph with maximum degree three to have an orthogonal drawing without bends was presented in [17].…”

Section: Introductionmentioning

confidence: 99%

“…Bertolazzi et al presented [1] a branch and bound algorithm that computes an orthogonal representation with the minimum number of bends of a biconnected planar graph. For drawings of non-planar graphs [9,3,13], the required area can be as little as 0.76n 2 [14], the total number of bends is no more than 2n + 2 [2,14], and each edge has at most two bends. Experimental studies have been conducted where various proposed algorithms were tested on their performance on area, bends, crossings, edge length, and time [21].…”

Section: Introductionmentioning

confidence: 99%

Overloaded Orthogonal Drawings

Kornaropoulos

Tollis

2012

Graph Drawing

View full text Add to dashboard Cite

Abstract. Orthogonal drawings are widely used for graph visualization due to their high clarity of representation. In this paper we present a technique called Overloaded Orthogonal Drawing. We first place the vertices on grid points following a relaxed version of dominance drawing, called weak dominance condition. Edge routing is implied automatically by the vertex coordinates. In order to simplify these drawings we use an overloading technique. All algorithms are simple and easy to implement and can be applied to directed acyclic graphs, planar, non-planar and also undirected graphs. We also present bounds on the number of bends and the area. Overloaded Orthogonal drawings present several interesting properties such as efficient visual edge confirmation as well as simplicity and clarity of the drawing.

show abstract

A better heuristic for orthogonal graph drawings

Cited by 110 publications

References 11 publications

Mario Kart Is Hard

Mario Kart Is Hard

Issues in interactive orthogonal graph drawing (preliminary version)

Overloaded Orthogonal Drawings

Contact Info

Product

Resources

About