An Algorithm For Computing The Distance Between Two Circular Disks

This paper presents an algorithm for computing the distance between two circular disks in three-dimensional space. A Kurush-Kuhn-Tucker (KKT) approach is used to solve the problem. We show that when the optimal points are not both at the borders of disks, the solutions of the KKT equations can be ob...

Full description

Saved in:
Bibliographic Details
Main Author: Almohamad, H.A. (author)
Other Authors: Selim, S.Z. (author), unknown (author)
Format: article
Published: 2020
Subjects:
Online Access:https://eprints.kfupm.edu.sa/id/eprint/2550/1/an_algorithm_for_computing_the_distance__almohamad_isi_000180460700003.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1864513390863450112
author Almohamad, H.A.
author2 Selim, S.Z.
unknown
author2_role author
author
author_facet Almohamad, H.A.
Selim, S.Z.
unknown
author_role author
dc.creator.none.fl_str_mv Almohamad, H.A.
Selim, S.Z.
unknown
dc.date.*.fl_str_mv 2020
dc.format.none.fl_str_mv application/pdf
dc.identifier.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/2550/1/an_algorithm_for_computing_the_distance__almohamad_isi_000180460700003.pdf
An Algorithm For Computing The Distance Between Two Circular Disks. Applied Mathematical Modelling, 27. pp. 115-124.
dc.language.none.fl_str_mv en
dc.publisher.none.fl_str_mv ELSEVIER SCIENCE INC
dc.relation.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/2550/
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.subject.none.fl_str_mv Computer
dc.title.none.fl_str_mv An Algorithm For Computing The Distance Between Two Circular Disks
dc.type.none.fl_str_mv Article
PeerReviewed
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
description This paper presents an algorithm for computing the distance between two circular disks in three-dimensional space. A Kurush-Kuhn-Tucker (KKT) approach is used to solve the problem. We show that when the optimal points are not both at the borders of disks, the solutions of the KKT equations can be obtained in closed-form. For the case where the points are at the circumferences, the problem has no analytical solutions [IBM J. Res. Develop. 34 (5) (1990)]. Instead, we propose for the latter case an iterative algorithm based on computing the distance between a fixed point and a circle. We also show that the point-circle distance problem is solvable in closed-form, and the convergence of the numerical algorithm is linear.
eu_rights_str_mv openAccess
format article
id KFUPM_a9d5cfcf1be49d3808fe232898c5ba5b
identifier_str_mv An Algorithm For Computing The Distance Between Two Circular Disks. Applied Mathematical Modelling, 27. pp. 115-124.
language_invalid_str_mv en
network_acronym_str KFUPM
network_name_str King Fahd University of Petroleum and Minerals
oai_identifier_str oai::2550
publishDate 2020
publisher.none.fl_str_mv ELSEVIER SCIENCE INC
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling An Algorithm For Computing The Distance Between Two Circular DisksAlmohamad, H.A.Selim, S.Z.unknownComputerThis paper presents an algorithm for computing the distance between two circular disks in three-dimensional space. A Kurush-Kuhn-Tucker (KKT) approach is used to solve the problem. We show that when the optimal points are not both at the borders of disks, the solutions of the KKT equations can be obtained in closed-form. For the case where the points are at the circumferences, the problem has no analytical solutions [IBM J. Res. Develop. 34 (5) (1990)]. Instead, we propose for the latter case an iterative algorithm based on computing the distance between a fixed point and a circle. We also show that the point-circle distance problem is solvable in closed-form, and the convergence of the numerical algorithm is linear.ELSEVIER SCIENCE INCArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/2550/1/an_algorithm_for_computing_the_distance__almohamad_isi_000180460700003.pdf An Algorithm For Computing The Distance Between Two Circular Disks. Applied Mathematical Modelling, 27. pp. 115-124. enhttps://eprints.kfupm.edu.sa/id/eprint/2550/2020info:eu-repo/semantics/openAccessoai::25502019-11-01T13:44:47Z
spellingShingle An Algorithm For Computing The Distance Between Two Circular Disks
Almohamad, H.A.
Computer
status_str publishedVersion
title An Algorithm For Computing The Distance Between Two Circular Disks
title_full An Algorithm For Computing The Distance Between Two Circular Disks
title_fullStr An Algorithm For Computing The Distance Between Two Circular Disks
title_full_unstemmed An Algorithm For Computing The Distance Between Two Circular Disks
title_short An Algorithm For Computing The Distance Between Two Circular Disks
title_sort An Algorithm For Computing The Distance Between Two Circular Disks
topic Computer
url https://eprints.kfupm.edu.sa/id/eprint/2550/1/an_algorithm_for_computing_the_distance__almohamad_isi_000180460700003.pdf