@inproceedings{e345ffb4492f4437828bc8c267c593dc,

title = "Visiting a sequence of points with a bevel-tip needle",

abstract = "Many surgical procedures could benefit from guiding a bevel-tip needle along circular arcs to multiple treatment points in a patient. At each treatment point, the needle can inject a radioactive pellet into a cancerous region or extract a tissue sample. Our main result is an algorithm to steer a bevel-tip needle through a sequence of treatment points in the plane while minimizing the number of times that the needle must be reoriented. This algorithm is related to [6] and takes quadratic time when consecutive points in the sequence are sufficiently separated. We can also guide a needle through an arbitrary sequence of points in the plane by accounting for a lack of optimal substructure.",

author = "S. Bitner and Y.K. Cheung and {Cook IV}, A.F. and O. Daescu and A. Kurdia and C. Wenk",

year = "2010",

doi = "10.1007/978-3-642-12200-2_43",

language = "English",

isbn = "978-3-642-12199-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "492--502",

editor = "A. L{\'o}pez-Ortiz",

booktitle = "LATIN 2010: Theoretical Informatics (Proceedings 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010)",

address = "Germany",

}