Name
Abstract | ||
|---|---|---|
Given a finite set of points in Euclidean space, we can ask what is the minimum number of times a piecewise-linear path must change direction in order to pass through all of them. We prove some new upper and lower bounds for a restricted version of this problem in which all motion is orthogonal to the coordinate axes. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/3-540-45071-8_47 | Int. J. Comput. Geometry Appl. |
Keywords | Field | DocType |
piecewise-linear path,restricted version,minimum number,finite set,lower bound,euclidean space,piecewise linear,upper and lower bounds | Set function,Discrete mathematics,Combinatorics,Ask price,Finite set,Upper and lower bounds,Euclidean space,Time complexity,Minimum time,Piecewise linearization,Mathematics | Journal |
Volume | Issue | ISSN |
14 | 1-2 | 0218-1959 |
ISBN | Citations | PageRank |
3-540-40534-8 | 1 | 0.37 |
References | Authors | |
3 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael J. Collins | 1 | 163 | 24.59 |