-The GPS navigation system is becoming increasingly popular. -The system uses the graph and geometric algorithms to calculate distances and map a route. -The section presents a geometric problem for finding a closest pair of point. y (-1, 3) 0 -1 3 .(3, 3) 1 1 -1 • (4, 2) (1, 1) 1 1 3 2 0.5 • (2, 0.5) 4 2 -1 • (4, -0.5) 3 3 (-1, -Î) • (2, -1) 4 7 2 4 -0.5 Figure 1: Points can be represented in a two-dimensional array. Given a set of points, write a program is to find the two points that are nearest to each other. Distance (d) between the two points „p1 and p2, is computed: d= /(*2 -x1)² + (Y2 -y1)² Where (x1,y1) and (x2,y2) are coordinates of p1 and p2, respectively. Prompt user to enter the number and coordinate of points. Here is sample output: Enter the number of points: 8 Enter 8 points: -1 3 -1-1 11 20.5 2-1 33 42 4-0.5 The closest two points are (1.0, 1.0) and (2.0, 0.5)
-The GPS navigation system is becoming increasingly popular. -The system uses the graph and geometric algorithms to calculate distances and map a route. -The section presents a geometric problem for finding a closest pair of point. y (-1, 3) 0 -1 3 .(3, 3) 1 1 -1 • (4, 2) (1, 1) 1 1 3 2 0.5 • (2, 0.5) 4 2 -1 • (4, -0.5) 3 3 (-1, -Î) • (2, -1) 4 7 2 4 -0.5 Figure 1: Points can be represented in a two-dimensional array. Given a set of points, write a program is to find the two points that are nearest to each other. Distance (d) between the two points „p1 and p2, is computed: d= /(*2 -x1)² + (Y2 -y1)² Where (x1,y1) and (x2,y2) are coordinates of p1 and p2, respectively. Prompt user to enter the number and coordinate of points. Here is sample output: Enter the number of points: 8 Enter 8 points: -1 3 -1-1 11 20.5 2-1 33 42 4-0.5 The closest two points are (1.0, 1.0) and (2.0, 0.5)
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
PLZ help with the following:
IN JAVA
![-The GPS navigation system is becoming increasingly popular.
-The system uses the graph and geometric algorithms to calculate distances and map a route.
-The section presents a geometric problem for finding a closest pair of point.
y
(-1, 3)
1
3
• (3, 3)
1
- 1
• (4, 2)
1
1
(1, 1)
3
2
0.5
• (2, 0.5)
4 2
-1
• (4, -0.5)
3
3
(-1, -1)
• (2, -1)
4
4 -0.5
Figure 1: Points can be represented in a two-dimensional array.
Given a set of points, write a program is to find the two points that are nearest to each other.
Distance (d) between the two points „p1 and p2, is computed:
V (x2 -×1)² +
(Y2 -Y1)2
d =
Where (x1y1) and (x2,y2) are coordinates of pl and p2, respectively.
Prompt user to enter the number and coordinate of points. Here is sample output:
Enter the number of points: 8
Enter 8 points: -13 -1-1 11 20.5 2-1 33 42 4-0.5
The closest two points are (1.0, 1.0) and (2.0, 0.5)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F87d967f7-8588-4966-a3b6-42737bf3ddcf%2F45f9540b-e9f9-42c3-abef-2276fc2ca04a%2Fjjk3jyj_processed.png&w=3840&q=75)
Transcribed Image Text:-The GPS navigation system is becoming increasingly popular.
-The system uses the graph and geometric algorithms to calculate distances and map a route.
-The section presents a geometric problem for finding a closest pair of point.
y
(-1, 3)
1
3
• (3, 3)
1
- 1
• (4, 2)
1
1
(1, 1)
3
2
0.5
• (2, 0.5)
4 2
-1
• (4, -0.5)
3
3
(-1, -1)
• (2, -1)
4
4 -0.5
Figure 1: Points can be represented in a two-dimensional array.
Given a set of points, write a program is to find the two points that are nearest to each other.
Distance (d) between the two points „p1 and p2, is computed:
V (x2 -×1)² +
(Y2 -Y1)2
d =
Where (x1y1) and (x2,y2) are coordinates of pl and p2, respectively.
Prompt user to enter the number and coordinate of points. Here is sample output:
Enter the number of points: 8
Enter 8 points: -13 -1-1 11 20.5 2-1 33 42 4-0.5
The closest two points are (1.0, 1.0) and (2.0, 0.5)
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education