From: Farley Flud Subject: Re: A Problem To Solve :-) Newsgroups: comp.os.linux.advocacy,sci.physics References: <17ac13c4ae353932$16712$1979536$802601b3@news.usenetexpress.com> Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Lines: 32 Path: ...!weretis.net!feeder6.news.weretis.net!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!feeder.usenetexpress.com!tr2.iad1.usenetexpress.com!news.usenetexpress.com!not-for-mail Date: Mon, 01 Apr 2024 10:13:29 +0000 Nntp-Posting-Date: Mon, 01 Apr 2024 10:13:29 +0000 X-Received-Bytes: 1978 X-Complaints-To: abuse@usenetexpress.com Organization: UsenetExpress - www.usenetexpress.com Message-Id: <17c22061208c6961$50483$3384359$802601b3@news.usenetexpress.com> Bytes: 2375 On Sun, 31 Mar 2024 19:40:02 -0500, Physfitfreak wrote: > > If the missile computes that 5 fighter jets at time t will exactly be at > these coordinates in the sky: > > Jet 1: (4.38 km, 3.9 km, 8.1 km) > Jet 2: (5.23 km, 9.61 km, 4.74 km) > Jet 3: (6.93 km, 6.01 km, 6.88 km) > Jet 4: (8.32 km, 2.12 km, 2.5 km) > Jet 5: (2.53 km, 4.23 km, 5.82 km) > > then answer the following 2 questions: > > 1- what would be the coordinates of the point in the sky, that the > missile with the weakest warhead needs to explode at, at time t, to > damage all those 5 fighter jets critically enough? > > 2- within what minimum radius of that explosion, any fighter jet would > get critically damaged at time t? > AFAIK, this is a very difficult problem.' But algorithms have recently been developed. The best one is, of course, implemented in FOSS: https://github.com/hbf/miniball When I get some free time I may try it out.