 |
 |
Geometry |
|
Authors: Andy Zhuang
In this paper, we first introduce the Minimal Overlapping Circle Expansion (MOCE) problem. Solution to such a problem has real-world applications, such as finding the location to best communicate with a number of wireless devices, finding the quickest way for a number of vehicles to get to a rendezvous location etc. We present several algorithms to compute the solution with different running time and accuracy. The first uses enclosing square to get an approximate solution; the second only considers pair-wise overlap to approximate; the third uses the the results of the first two and a few other methods to speed up the computation. Our results show that (1) the approximate algorithm can be 1000 times faster than the accurate algorithm, and get to 99.9% of the correct value. (2) improvements can cut down the compute time by 50% for the accurate algorithm.
Comments: 18 Pages. (Note by viXra Admin: Please submit article written with AI assistance to ai.viXra.org)
Download: PDF
[v1] 2025-12-29 00:32:22
Unique-IP document downloads: 195 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.
| Third-Party Links: |
|