@inproceedings{b83126471921470aaffda8f563847696,
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.",
keywords = "Biopsy, Brachytherapy, Link distance, Needle steering",
author = "Steven Bitner and Cheung, {Yam K.} and {Cook IV}, {Atlas F.} and Ovidiu Daescu and Anastasia Kurdia and Carola Wenk",
note = "Funding Information: This work has been supported by NSF CAREER CCF-0643597, CCF-0635013, and the 2009 University of Texas at San Antonio Presidential Dissertation Fellowship.; 9th Latin American Theoretical Informatics Symposium, LATIN 2010 ; Conference date: 19-04-2010 Through 23-04-2010",
year = "2010",
doi = "10.1007/978-3-642-12200-2_43",
language = "English (US)",
isbn = "3642121993",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "492--502",
booktitle = "LATIN 2010",
}