![]() |
@inproceedings{DBLP:conf/compgeom/KahanS96,
author = {Simon Kahan and
Jack Snoeyink},
title = {On the Bit Complexity of Minimum Link Paths: Superquadratic
Algorithms for Problems Solvable in Linear Time},
booktitle = {Symposium on Computational Geometry},
year = {1996},
pages = {151-158},
ee = {http://doi.acm.org/10.1145/237218.237342},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2002-12-13 by Michael Ley (ley@uni-trier.de)