Visiting a sequence of points with a bevel-tip needle

S. Bitner, Y.K. Cheung, A.F. Cook IV, O. Daescu, A. Kurdia, C. Wenk

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)


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.
Original languageEnglish
Title of host publicationLATIN 2010: Theoretical Informatics (Proceedings 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010)
EditorsA. López-Ortiz
Place of PublicationBerlin
ISBN (Print)978-3-642-12199-9
Publication statusPublished - 2010

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'Visiting a sequence of points with a bevel-tip needle'. Together they form a unique fingerprint.

Cite this