#### Filter Results:

#### Publication Year

2003

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Damian Merrick, Joachim Gudmundsson
- Graph Drawing
- 2006

We investigate the problem of creating simplified representations of polygonal paths. Specifically, we look at a path simplification problem in which line segments of a simplification are required to conform with a restricted set of directions C. An algorithm is given to compute such simplified paths in O(|C| 3 n 2) time, where n is the number of vertices… (More)

- Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nascimento
- J. Vis. Lang. Comput.
- 2006

We investigate the new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic criteria for good metro map layouts and present a method to produce such layouts automatically. Our method uses a variation of the spring algorithm with a suitable preprocessing… (More)

- Yasemine Altun, Karsten Borgwardt, +17 authors Ben Yip
- 2007

I hereby certify that the work embodied in this thesis is the result of original research and has not been submitted for a higher degree to any other University or Institution. Acknowledgements Many individuals and institutions contributed in many different ways to the completion of this thesis. I am deeply grateful for their support, and thankful for the… (More)

- Damian Merrick, Tim Dwyer
- InVis.au
- 2004

The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computer-generated characters for motion pictures and computer games. This paper investigates the use of similar techniques in the scope of exploring three-dimensional visualisations of graphs. A system is discussed which, after generating an… (More)

- Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nascimento
- InVis.au
- 2004

We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic criteria for good metro map layouts and present a method to produce such layouts automatically. Our method uses a variation of the spring algorithm with a suitable preprocessing step.… (More)

⋆ The results presented in this paper were announced at the 18th International Symposium on Algorithms and Computation held in Sendai in December 2007. Abstract A trajectory is a sequence of locations, each associated with a timestamp, describing the movement of a point. Trajectory data is becoming increasingly available and the size of recorded… (More)

- Adel Ahmed, Vladimir Batagelj, Xiaoyan Fu, Seok-Hee Hong, Damian Merrick, Andrej Mrvar
- APVIS
- 2007

In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet Movie DataBase (IMDB). Our approach is to integrate network analysis methods with visualisation in order to address scalability and complexity issues. In particular, we defined new analysis methods such as… (More)

- Martin Nöllenburg, Damian Merrick, Alexander Wolff, Marc Benkert
- Computers, Environment and Urban Systems
- 2008

We study the problem of morphing between two polylines that represent linear geographical features like roads or rivers generalized at two different scales. This problem occurs frequently during continuous zooming in interactive maps. Situations in which generalization operators like typification and simplification replace, for example, a series of… (More)

- Matthew Asquith, Joachim Gudmundsson, Damian Merrick
- CATS
- 2008

In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in G (e.g. the train lines), we want to draw the paths along the edges of G such that they cross each other as few times as possible. For aesthetic reasons we insist that the… (More)

- Magdalene G. Borgelt, Marc J. van Kreveld, +4 authors Mostafa Vahedi
- J. Discrete Algorithms
- 2009

Given a set S of n red and blue points in the plane, a planar bichromatic minimum spanning tree is the shortest possible spanning tree of S, such that every edge connects a red and a blue point, and no two edges intersect. Computing this tree is NP-hard in general. We present an O(n 3) time algorithm for the special case when all points are in convex… (More)