d1-optimal motion for a rod

Tetsuo Asano, David Kirkpatrick, Chee Yap

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

Abstract

We study the motion of a rod (line segment) in the plane in the presence of polygonal obstacles, under an optimality criterion based on minimizing the orbit length of a fixed but arbitrary point (called the focus) on the rod. Our central result is that this problem is NP-hard when the focus is in the relative interior of the rod. Other results include a local characterization of this so-called d1-optimal motion, and an efficient approximation algorithm.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherACM
Pages252-263
Number of pages12
StatePublished - 1996
EventProceedings of the 1996 12th Annual Symposium on Computational Geometry - Philadelphia, PA, USA
Duration: May 24 1996May 26 1996

Other

OtherProceedings of the 1996 12th Annual Symposium on Computational Geometry
CityPhiladelphia, PA, USA
Period5/24/965/26/96

Fingerprint

Approximation algorithms
Computational complexity
Orbits
Motion
Optimality Criteria
Line segment
Approximation Algorithms
Interior
Efficient Algorithms
NP-complete problem
Orbit
Arbitrary

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Geometry and Topology

Cite this

Asano, T., Kirkpatrick, D., & Yap, C. (1996). d1-optimal motion for a rod. In Proceedings of the Annual Symposium on Computational Geometry (pp. 252-263). ACM.

d1-optimal motion for a rod. / Asano, Tetsuo; Kirkpatrick, David; Yap, Chee.

Proceedings of the Annual Symposium on Computational Geometry. ACM, 1996. p. 252-263.

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

Asano, T, Kirkpatrick, D & Yap, C 1996, d1-optimal motion for a rod. in Proceedings of the Annual Symposium on Computational Geometry. ACM, pp. 252-263, Proceedings of the 1996 12th Annual Symposium on Computational Geometry, Philadelphia, PA, USA, 5/24/96.
Asano T, Kirkpatrick D, Yap C. d1-optimal motion for a rod. In Proceedings of the Annual Symposium on Computational Geometry. ACM. 1996. p. 252-263
Asano, Tetsuo ; Kirkpatrick, David ; Yap, Chee. / d1-optimal motion for a rod. Proceedings of the Annual Symposium on Computational Geometry. ACM, 1996. pp. 252-263
@inproceedings{7ae445b2917549caabfe4bc75a64a095,
title = "d1-optimal motion for a rod",
abstract = "We study the motion of a rod (line segment) in the plane in the presence of polygonal obstacles, under an optimality criterion based on minimizing the orbit length of a fixed but arbitrary point (called the focus) on the rod. Our central result is that this problem is NP-hard when the focus is in the relative interior of the rod. Other results include a local characterization of this so-called d1-optimal motion, and an efficient approximation algorithm.",
author = "Tetsuo Asano and David Kirkpatrick and Chee Yap",
year = "1996",
language = "English (US)",
pages = "252--263",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",
publisher = "ACM",

}

TY - GEN

T1 - d1-optimal motion for a rod

AU - Asano, Tetsuo

AU - Kirkpatrick, David

AU - Yap, Chee

PY - 1996

Y1 - 1996

N2 - We study the motion of a rod (line segment) in the plane in the presence of polygonal obstacles, under an optimality criterion based on minimizing the orbit length of a fixed but arbitrary point (called the focus) on the rod. Our central result is that this problem is NP-hard when the focus is in the relative interior of the rod. Other results include a local characterization of this so-called d1-optimal motion, and an efficient approximation algorithm.

AB - We study the motion of a rod (line segment) in the plane in the presence of polygonal obstacles, under an optimality criterion based on minimizing the orbit length of a fixed but arbitrary point (called the focus) on the rod. Our central result is that this problem is NP-hard when the focus is in the relative interior of the rod. Other results include a local characterization of this so-called d1-optimal motion, and an efficient approximation algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0029703026&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029703026&partnerID=8YFLogxK

M3 - Conference contribution

SP - 252

EP - 263

BT - Proceedings of the Annual Symposium on Computational Geometry

PB - ACM

ER -