Line circle intersection: Difference between revisions

 

=={{header|AutoHotkey}}==

, [[3, -5], 3, [-10, 11], [-11, 12], 1]

, [[3, -5], 3, [3, -2], [7, -2], 1]

sgn(x){

return x<0?-1:1

{{out}}

<pre>Center Rad P1 P2 Segment intersect 1 Intersect 2

=={{header|C}}==

{{trans|Go}}

#include <stdbool.h>

#include <stdio.h>

 

return 0;

{{out}}

<pre>The intersection points (if any) between:

=={{header|C++}}==

{{trans|Kotlin}}

#include <utility>

#include <vector>

 

return 0;

{{out}}

<pre>The intersection points (if any) between:

=={{header|C#}}==

{{trans|C++}}

using System.Collections.Generic;

using System.Linq;

public override string ToString() => $"{{ C:{Center}, R:{Radius} }}";

}

{{out}}

<pre>Circle: { C:(3, -5), R:3 }

=={{header|D}}==

{{trans|C++}}

import std.math;

import std.stdio;

writeln(" a segment starting at ", p1, " and ending at ", p2, " is/are:");

writeln(" ", intersects(p1, p2, cp, r, true));

{{out}}

<pre>The intersection points (if any) between:

 

=={{header|Go}}==

 

import (

fmt.Println("\n a segment starting at (7, 4) and ending at (11, 8) is/are:")

fmt.Println(" ", intersects(point{7, 4}, point{11, 8}, cp, r, true))

 

{{out}}

 

=={{header|Haskell}}==

 

main :: IO ()

sgn x

| 0 > x = -1

{{out}}

<pre>Intersection: Circle (3.0,-5.0) 3.0 and Line (-10.0,11.0) (10.0,-9.0): [(3.0,-2.0),(6.0,-5.0)]

 

=={{header|Java}}==

import java.awt.geom.*;

 

return str.toString();

}

 

{{out}}

=={{header|Julia}}==

Uses the circles and points from the Go example.

 

const centers = [Point(3, -5), Point(0, 0), Point(4, 2)]

length(v) == 2 ? rpad(v[1], 18) * string(v[2]) : v[1])

end

<pre>

Center Radius Line P1 Line P2 Segment? Intersect 1 Intersect 2

=={{header|Kotlin}}==

{{trans|Go}}

import kotlin.math.sqrt

 

println(" a segment starting at $p1 and ending at $p2 is/are:")

println(" ${intersects(p1, p2, cp, r, true)}")

{{out}}

<pre>The intersection points (if any) between:

=={{header|Lua}}==

{{trans|C++}}

 

function pts(p)

end

 

{{out}}

<pre>The intersection points (if any) between:

 

=={{header|Mathematica}}/{{header|Wolfram Language}}==

LineCircleIntersections[{-1, 1}, {1, 1}, {0, 0}, 1, Line]

LineCircleIntersections[{-1, 0}, {2, 0.4}, {0, 0}, 1, Line]

LineCircleIntersections[{-1.5, 0}, {-2, 0.4}, {0, 0}, 1, Line]

{{out}}

<pre>Point[{{0,1}}]

=={{header|Nim}}==

{{trans|Go}}

 

const Eps = 1e-14

echo " ", intersects((6.0, 3.0), (10.0, 7.0), cp, r, false)

echo "\n a segment starting at (7, 4) and ending at (11, 8) is/are:"

 

{{out}}

 

=={{header|Perl}}==

use warnings;

use feature 'say';

say 'Solutions: ' . (@solution > 1 ? join ', ', map { '('. join(',', rnd @$_) .')' } @solution : 'None');

say '';

{{out}}

<pre>For input: (-10,11), (10,-9), (3,-5), 3

{{trans|Go}}

{{trans|zkl}}

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">constant</span> <span style="color: #000000;">epsilon</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">1e-14</span> <span style="color: #000080;font-style:italic;">-- say</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre>

(formerly Perl 6)

Extend solution space to 3D. Reference: this [https://stackoverflow.com/questions/1073336/ SO question and answers]

my @d = @P2 »-« @P1 ; # d

my @f = @P1 »-« @Centre ; # c

say "For data set: ", $_;

say "Solution(s) is/are: ", @solution.Bool ?? @solution !! "None";

{{out}}

<pre>For data set: [(-10 11) (10 -9) (3 -5) 3]

The formulae used for this REXX version were taken from the MathWorld

webpage: &nbsp; [https://mathworld.wolfram.com/Circle-LineIntersection.html circle line intersection].

/*───────────────────────────────────── line= x1,y1 x2,y2; circle is at 0,0, radius=r*/

parse arg x1 y1 x2 y2 cx cy r . /*obtain optional arguments from the CL*/

numeric form; m.=9; parse value format(x,2,1,,0) 'E0' with g "E" _ .; g=g *.5'e'_ %2

do j=0 while h>9; m.j= h; h= h%2 + 1; end /*j*/

{{out|output|text=&nbsp; when using the default inputs:}}

<pre>

=={{header|Ruby}}==

{{trans|C++}}

 

def sq(x)

end

 

{{out}}

<pre>The intersection points (if any) between:

=={{header|Rust}}==

{{trans|C++}}

use assert_approx_eq::assert_approx_eq;

 

}

}

 

{{out}}

=={{header|Swift}}==

{{trans|Java}}

import CoreGraphics

 

center: center, radius: radius,

segment: true)

 

{{out}}

=={{header|Visual Basic .NET}}==

{{trans|C#}}

 

Structure Point

End Sub

 

{{out}}

<pre>Circle: { C:(3, -5), R:3 }

{{trans|Kotlin}}

{{libheader|Wren-dynamic}}

 

var Point = Tuple.create("Point", ["x", "y"])

p2 = Point.new(11, 8)

System.print(" a segment starting at %(p1) and ending at %(p2) is/are:")

 

{{out}}

=={{header|zkl}}==

{{trans|Go}}

// p1,p2 are (x,y), circle is ( (x,y),r )

fcn intersectLineCircle(p1,p2, circle, segment=False) // assume line

if(d==0) return( T( T(ux,uy) ) );

return( T(ux,uy), T(vx,vy) )

println("Circle @ ",circle); lcpp(p1,p2,circle);

p2:=T(-11,12); lcpp(p1,p2,circle,True);

.fmt(segment and "Segment" or "Line ",

p1,p2,intersectLineCircle(p1,p2, circle,segment)));

{{out}}

<pre>