Visiting a sequence of points with a bevel-tip needle

Steven Bitner*, Yam K. Cheung, Atlas F. Cook IV, Ovidiu Daescu, Anastasia Kurdia, Carola Wenk

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationLATIN 2010
Subtitle of host publicationTheoretical Informatics - 9th Latin American Symposium, Proceedings
Pages492-502
Number of pages11
DOIs
StatePublished - 2010
Event9th Latin American Theoretical Informatics Symposium, LATIN 2010 - Oaxaca, Mexico
Duration: Apr 19 2010Apr 23 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6034 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th Latin American Theoretical Informatics Symposium, LATIN 2010
Country/TerritoryMexico
CityOaxaca
Period4/19/104/23/10

Keywords

  • Biopsy
  • Brachytherapy
  • Link distance
  • Needle steering

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

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

Cite this