|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 68 of 101 found articles
| Title: |
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time |
| Author: |
Kahan, Simon Snoeyink, Jack |
| Appeared in: |
Computational geometry |
| Paging: | Volume 12 (1999) nr. 1-2 pages 12 p. |
| Year: |
1999 |
| Contents: | |
| Publisher: |
Elsevier Science B.V. |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 68 of 101 found articles
| << previous | next >> |