📜  检查一个点是在椭圆的内部,外部还是在椭圆上

📅  最后修改于: 2021-04-24 03:47:26             🧑  作者: Mango

给定一个以(h,k)为中心的椭圆,且半长轴a和半短轴b均与笛卡尔平面对齐。任务是确定点(x,y)是否在椭圆限制的区域内。
例子:

Input: h = 0, k = 0, x = 2, y = 1, a = 4, b = 5 
Output: Inside

Input: h = 1, k = 2, x = 200, y = 100, a = 6, b = 5
Output: Outside

方法:我们必须求解给定点(x,y)的椭圆方程,

如果不等式中的结果小于1,则该点位于该点之内;否则,如果该点正1,则该点位于椭圆上;如果不等式不满足,则点位于椭圆之外
下面是上述方法的实现

C++
// C++ Program to check if the point
// lies within the ellipse or not
#include 
using namespace std;
 
// Function to check the point
int checkpoint(int h, int k, int x, int y, int a, int b)
{
 
    // checking the equation of
    // ellipse with the given point
    int p = (pow((x - h), 2) / pow(a, 2))
            + (pow((y - k), 2) / pow(b, 2));
 
    return p;
}
 
// Driver code
int main()
{
    int h = 0, k = 0, x = 2, y = 1, a = 4, b = 5;
 
    if (checkpoint(h, k, x, y, a, b) > 1)
        cout << "Outside" << endl;
 
    else if (checkpoint(h, k, x, y, a, b) == 1)
        cout << "On the ellipse" << endl;
 
    else
        cout << "Inside" << endl;
 
    return 0;
}


Java
// Java Program to check if the point
// lies within the ellipse or not
import java.util.*;
 
class solution
{
  
// Function to check the point
static int checkpoint(int h, int k, int x, int y, int a, int b)
{
 
    // checking the equation of
    // ellipse with the given point
    int p = ((int)Math.pow((x - h), 2) / (int)Math.pow(a, 2))
            + ((int)Math.pow((y - k), 2) / (int)Math.pow(b, 2));
 
    return p;
}
 
//Driver code
public static void main(String arr[])
{
   
    int h = 0, k = 0, x = 2, y = 1, a = 4, b = 5;
 
    if (checkpoint(h, k, x, y, a, b) > 1)
       System.out.println("Outside");
 
    else if (checkpoint(h, k, x, y, a, b) == 1)
        System.out.println("On the ellipse");
 
    else
       System.out.println("Inside");
 
}
}
 
//This code is contributed by Surendra_Gangwar


Python 3
# Python 3 Program to check if
# the point lies within the
# ellipse or not
import math
 
# Function to check the point
def checkpoint( h, k, x, y, a, b):
 
    # checking the equation of
    # ellipse with the given point
    p = ((math.pow((x - h), 2) // math.pow(a, 2)) +
         (math.pow((y - k), 2) // math.pow(b, 2)))
 
    return p
 
# Driver code
if __name__ == "__main__":
 
    h = 0
    k = 0
    x = 2
    y = 1
    a = 4
    b = 5
 
    if (checkpoint(h, k, x, y, a, b) > 1):
        print ("Outside")
 
    elif (checkpoint(h, k, x, y, a, b) == 1):
        print("On the ellipse")
 
    else:
        print("Inside")
 
# This code is contributed
# by ChitraNayal


C#
// C# Program to check if the point
// lies within the ellipse or not
using System;
 
class GFG
{
 
// Function to check the point
static int checkpoint(int h, int k, int x,
                      int y, int a, int b)
{
 
    // checking the equation of
    // ellipse with the given point
    int p = ((int)Math.Pow((x - h), 2) /
             (int)Math.Pow(a, 2)) +
            ((int)Math.Pow((y - k), 2) /
             (int)Math.Pow(b, 2));
 
    return p;
}
 
// Driver code
public static void Main()
{
    int h = 0, k = 0, x = 2,
        y = 1, a = 4, b = 5;
 
    if (checkpoint(h, k, x, y, a, b) > 1)
    Console.WriteLine("Outside");
 
    else if (checkpoint(h, k, x, y, a, b) == 1)
        Console.WriteLine("On the ellipse");
 
    else
    Console.WriteLine("Inside");
}
}
 
// This code is contributed by inder_verma


PHP
 1)
    echo ("Outside");
 
else if (checkpoint($h, $k, $x, $y, $a, $b) == 1)
    echo("On the ellipse" );
 
else
    echo ("Inside") ;
     
// This code is contributed by Shivi_Aggarwal
?>


Javascript


输出:
Inside