Skip to main navigation Skip to search Skip to main content

Determining an optimal penetration among weighted regions in two and three dimensions

  • Danny Z. Chen
  • , Ovidiu Daescu
  • , Xiaobo Hu
  • , Xiaodong Wu
  • , Jinhui Xu
  • University of Notre Dame

Research output: Contribution to conferencePaperpeer-review

10 Scopus citations

Abstract

We present efficient algorithms for solving the problem of computing an optimal penetration (a ray or a line segment) among weighted regions in 2-D and 3-D spaces. This problem finds applications in several areas, such as radiation therapy, geological exploration, and environmental engineering. Our algorithms are based on a combination of geometric techniques and optimization methods. Our geometric analysis shows that the optimal penetration problem in d-D (d = 2, 3) can be reduced to solving O(n2(d-1)) instances of certain special types of nonlinear optimization problems, where n is the total number of vertices of the regions. We also give implementation results of our 2-D algorithms.

Original languageEnglish
Pages322-331
Number of pages10
DOIs
StatePublished - 1999
EventProceedings of the 1999 15th Annual Symposium on Computational Geometry - Miami Beach, FL, USA
Duration: Jun 13 1999Jun 16 1999

Conference

ConferenceProceedings of the 1999 15th Annual Symposium on Computational Geometry
CityMiami Beach, FL, USA
Period06/13/9906/16/99

Fingerprint

Dive into the research topics of 'Determining an optimal penetration among weighted regions in two and three dimensions'. Together they form a unique fingerprint.

Cite this