Jump to content

Talk:Circles of given radius through two points

From Rosetta Code

More special cases

There may be more special cases. If p1==p2 and r==0, there is one unique answere that's a zero radius circle. If two points are separated by exactly double the radius, there's only one answer. The latter can be treated as two identical circles, but then so can the former. <lang python>from math import sqrt

def find_center(p1, p2, r):

   if p1 == p2:
       if r == 0: return [p1] # special special case
       # maybe we can return a generator that yields random circles, eh?
       raise ValueError("infinite many answers")
   (x1,y1), (x2,y2) = p1, p2
   x, y = (x1 + x2)/2.0, (y1 + y2)/2.0
   dx, dy = x1 - x, y1 - y
   a = r*r / (dx*dx + dy*dy) - 1
   if not a: return [(x0, y0)]
   if a < 0: return []
   a = sqrt(a)
   return [(x + a*dy, y - a*dx), (x - a*dy, y + a*dx)]

print find_center((0, 0), (1, 1), 1) # normal case print find_center((0, 0), (0, 0), 0) # special case 1 print find_center((0, 0), (0, 2), 1) # special case 2</lang>

Hi Ledrug. I have one of those covered - two points on a diameter is tested by the current second set of inputs. I'll have to adjust for the two coincident points with r == 0.0 case. Thanks.
Hmm r==0.0 might be treated as an exception too as it is the circle as a point, (If you don't want points). --Paddy3118 (talk) 05:02, 17 April 2013 (UTC)
A circle with zero radius is still a perfectly valid circle, I don't see why it should be excluded. --Ledrug (talk) 19:55, 17 April 2013 (UTC)
But it does require the points to be coincident or it has no solution. –Donal Fellows (talk) 20:28, 17 April 2013 (UTC)
I was talking about when you do get a zero circle as a solution. --Ledrug (talk) 22:59, 17 April 2013 (UTC)
I could change it or leave it. Either case would work as the task explicitly states what to do with the r == 0.0 case, currently. --Paddy3118 (talk) 21:11, 17 April 2013 (UTC)
The task states two mutually-incompatible things in that case. –Donal Fellows (talk) 12:35, 27 April 2013 (UTC)
And based on that, I've removed the marking of the Tcl version as incorrect. Inconsistencies in the spec mean that I can do that. (Anyone arguing that there always has to be two circles returned is just confusing restrictions caused by the way their language wants to do things; the natural thing in Tcl is just to return a list of all the circles that there are.) –Donal Fellows (talk) 13:53, 27 April 2013 (UTC)
And dealing with nearly "normal" specifications are an important part of programming ;-)
--Paddy3118 (talk) 21:15, 17 April 2013 (UTC)

XPL0

REXX referred to XPL0. This section was removed at some point in time. Unfortunately the History does not show when and by whom. I restored now the old section --Walter Pachl 08:35, 15 October 2017 (UTC)

By   referred to,   it was meant that REXX entry was a translation   {{trans|XPL0}}   of the   XPL0.   entry.   -- Gerard Schildberger (talk) 08:43, 15 October 2017 (UTC)
What's that other than a reference? --Walter Pachl 08:52, 15 October 2017 (UTC)
A reference could be anything that referenced (mentioned) something else by name but not necessarily contained herein on Rosetta Code   --- for instance, the language   xyz   used/uses the assumption(s) yadda-yadda-yadda,   or entry   xyz   used a similar approach, logic, data (for input), ...   or any other number of things, most often (but not limited to) somewhere in the entry's preamble (or comments made elsewhere).   However, a   {{trans|XPL0}}   means that (in this case) the   REXX   entry used (most likely) the   XPL0   entry (the source code here on this Rosetta Code task) as a basis or prototype for the computer programming language translation.   -- Gerard Schildberger (talk) 09:52, 15 October 2017 (UTC)
Walter, the XPL0 was actually never removed: this edit adding the entry on Visual FoxPro mistakenly ended with a pre HTML tag, which made the XPL0 entry show up at the end of the VisualFox Pro entry. I'll remove it now. Eoraptor (talk) 20:17, 28 December 2017 (UTC)
Cookies help us deliver our services. By using our services, you agree to our use of cookies.