Determining two minimal circumscribing discs for a polygon

March 1995

Determining two minimal circumscribing discs for a polygon

Authors:

Yangsheng Xu, Raju S. Mattikalli, and Pradeep Khosla

Abstract:

The paper proposes a 2-disc motion planning strategy to navigate an object within free space between obstacles from an initial location to a final location. The method makes use of the medial axis transform of the free space. Two minimal overlapping discs that fully enclose the moving object are determined, and then the centres of the two discs are constrained to move continuously along a path on the medial axis. The paper focuses on the problem of finding the two enclosing discs for an arbitrary moving polygon object. The problem is reduced to one of finding an optimal straight line cut through the polygon such that each of the subpolygons can be covered by a minimal disc. The paper discusses how an arbitrary polygon is cut, and how the two minimal overlapping discs that cover the given polygon are determined. Simulations are presented for a variety of polygons. The method has been used for planning part disassembly motion from inside to outside assembly.
@article{Xu-1995-16104,
author = {Yangsheng Xu And Raju S. Mattikalli And Pradeep Khosla},
title = {Determining two minimal circumscribing discs for a polygon},
journal = {Proceedings of Computer-Aided Design},
year = {1995},
month = {March},
volume = {27},
number = {3},
pages = {223 - 234},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.