12264 search results - page 2 / 2453 » Analysis of the rubberband algorithm |
90
Voted
CCCG
2010
15 years 2 months ago
2010
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
107
Voted
ICCAD
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper presents a unique approach to improve yield given a routed layout. Currently after routing has been completed and compacted, it generally proceeds to verification witho...
113
Voted
GD
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
104
Voted
DGCI
2005
Springer
15 years 6 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
91
Voted
CORR
2002
Springer
15 years 28 days ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...