Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
bartleby

Concept explainers

bartleby

Videos

Textbook Question
Book Icon
Chapter 22, Problem 22.11PE

(Geometry: Graham’s algorithm for finding a convex hull) Section 22.10.2 introduced Graham’s algorithm for finding a convex hull for a set of points. Assume Java’s coordinate system is used for the points. Implement the algorithm using the following method:

   /** Return the points that form a convex hull */

   public static ArrayList<MyPoint> getConvexHull (double[][] s)

MyPoint is a static inner class defined as follows:

  private static class MyPoint implements Comparable<MyPoint> {

   double x, y;

   MyPoint rightMostLowestPoint;

          MyPoint (double x, double y) {

            this.x = x; this.y = y;

          }

          public void setRightMostLowestPoint(MyPoint p) {

             rightMostLowestPoint = p;

          }

          @Override

          public int compareTo(MyPoint o) {

            // Implement it to compare this point with point o

            // angularly along the x-axis with rightMostLowestPoint

            // as the center, as shown in Figure 22.10b. By implementing

            // the Comparable interface, you can use the Array.sort

            // method to sort the points to simplify coding.

           }

         }

Write a test program that prompts the user to enter the set size and the points, and displays the points that form a convex hull, Here is a sample run:

How many points are in the set? 6 Chapter 22, Problem 22.11PE, (Geometry: Grahams algorithm for finding a convex hull) Section 22.10.2 introduced Grahams algorithm , example  1

Enter six points: 1 2.4 2.5 2 1.5 34.5 5.5 6 6 2.4 5.5 9 Chapter 22, Problem 22.11PE, (Geometry: Grahams algorithm for finding a convex hull) Section 22.10.2 introduced Grahams algorithm , example  2

The convex hull is

  (1.5, 34.5) (5.5, 9.0) (6.0, 2.4) (2.5, 2.0) (1.0, 2.4)

Blurred answer
Students have asked these similar questions
- a) Answer these Theoretical Questions: 1. Explain the rule of thumb for the Big O. Provide at least one example of applying each rule. 2. What is the Big O of each of the following functions? a) (n + 1)³/n b) (n³ + logзn) ³/n c) n + 100n³ + n d) 3n+ 100n3 + 3n * e) n 3n+ n * 33n 3. Describe an algorithm for finding the occurrence of the max element in an array. Analyze the complexity of the algorithm. 4. What is Divide-and-Conquer? What is the difference between Divide-and-Conquer and Dynamic Programming? What are the benefits of using one over another if any? 5. Is it possible to design an algorithm for finding the max element in a list using Divide-and-Conquer? What is the complexity of this algorithm? Hint: In this approach, the initial array is divided into two halves... b) Programming assignment: Implement initiative / naïve method to find a max element in an array. Implement the method that uses the Divide-and-Conquer approach to find the max element in an array. Test both…
9. Given the following Boolean Function: F(P, Q, R) = PQ+QR+PR F(P,Q,R) (i) Derive the canonical SOP (sum of minterms) for F. (ii) Derive the canonical POS (product of maxterms) for F. (iii) Draw the truth table, clearly marking which rows are minterms of F and which rows correspond to maxterms of F. 10) For n Boolean variables, how many distinct Boolean functions exist? Give the answer as a function of n and briefly justify it.
Please Show an Example in R: Find (or invent) some data (not from the “Data” directory supplied with EssentialR) and import it into R. (It is not a bad idea to include a commented line with units for each variable in your .txt or.csv file). a) What did you have to do to “clean it up” so it would read in? b) Are you satisfied with the console output of summary(yourdata)? Did all the variables import in the way (format) you thought they should? c) Include the output of summary(yourdata) and head(yourdata).

Chapter 22 Solutions

Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)

Additional Engineering Textbook Solutions

Find more solutions based on key concepts
Knowledge Booster
Background pattern image
Computer Science
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.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:9781337102124
Author:Diane Zak
Publisher:Cengage Learning
Text book image
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
9.1: What is an Array? - Processing Tutorial; Author: The Coding Train;https://www.youtube.com/watch?v=NptnmWvkbTw;License: Standard Youtube License