Gill Barequet Danny Z. Chen Ovidiu Daescu Michael T. Goodrich Jack Snoeyink Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. 150-167 2002 33 Algorithmica 2 http://link.springer.de/link/service/journals/00453/bibs/2033002/20330150.html db/journals/algorithmica/algorithmica33.html#BarequetCDGS02