Sciweavers

1859 search results - page 288 / 372
» Sketch-based path design
Sort
View
141
Voted
GD
2005
Springer
15 years 9 months ago
A Mixed-Integer Program for Drawing High-Quality Metro Maps
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
Martin Nöllenburg, Alexander Wolff
125
Voted
SOFSEM
2005
Springer
15 years 9 months ago
Volumes of 3D Drawings of Homogenous Product Graphs
d Abstract) Lubomir Torok Institute of Mathematics and Computer Science Slovak Academy of Sciences Severna 5, 974 01 Banska Bystrica, Slovak Republic 3-dimensional layout of graph...
Lubomir Torok
127
Voted
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
15 years 9 months ago
On Geometric Dilation and Halving Chords
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar ...
139
Voted
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
15 years 9 months ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar
121
Voted
DAC
2004
ACM
15 years 9 months ago
Optical proximity correction (OPC): friendly maze routing
As the technology migrates into the deep submicron manufacturing (DSM) era, the critical dimension of the circuits is getting smaller than the lithographic wavelength. The unavoid...
Li-Da Huang, Martin D. F. Wong