Question: Let P be a given polygon (not necessarily convex) whose vertices are {v1,...vn} appearing in this order along boundary. Suggest an O(n) time algorithm that

Let P be a given polygon (not necessarily convex) whose vertices are {v1,...vn} appearing in this order along boundary. Suggest an O(n) time algorithm that creates a new data structure, so you could answer the following query in O(logn): Given a query line L ={(x,y)|ax+by=c}, does L intersect P? Note that if b= 0 and start by finding in O(logn) the highest and lowest points of P.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

(a) In SystemVerilog, what is the difference between: (i) The ternary operator ? and if...then...else statements? [2 marks] (ii) always_ff and always_comb? [2 marks] (iii) Blocking, non-blocking and...

A discrete sequence {xn} can be converted into a continuous representation x(t) = ts X n= (t n ts) xn, where ts is the sampling period. (a) State two characteristic properties of Dirac's function. [2...

Python and most Python libraries are free to download or use, though many users use Python through a paid service. Paid services help IT organizations manage the risks associated with the use of...

The Basics of Financial Mathematics Spring 2003 Richard F. Bass Department of Mathematics University of Connecticut c These notes are 2003 by Richard Bass. They may be used for personal use or class...

Let A, B be sets. Define: (a) the Cartesian product (A B) (b) the set of relations R between A and B (c) the identity relation A on the set A [3 marks] Suppose S, T are relations between A and B, and...

QUIZ... Let D be a poset and let f : D D be a monotone function. (i) Give the definition of the least pre-fixed point, fix (f), of f. Show that fix (f) is a fixed point of f. [5 marks] (ii) Show that...

re Regular Languages and Finite Automata (a) Let L be the set of all strings over the alphabet {a, b} that end in a and do not contain the substring bb. Describe a deterministic finite automaton...

Describe and justify an algorithm for finding the shortest distance between each pair of vertices in an undirected graph in which each edge has a given positive length. If there is no path between a...

Assume that you have an algorithm that can fill 3D triangles with a constant colour. Explain what additional information and additions to the algorithm are required to Gouraud shade the triangles....

Write an alternative definition that is tail-recursive (iterative) and makes use of accumulator variables. [10 marks] Explain why your alternative definition executes more efficiently. [3 marks] 1...

Prove that the nth roots of unity form a geometric progression. Also show that the sum of these n roots is zero and their product is (-1)^ n-1.

Compose an appropriate persuasive cover letter. Cover letters complement rsums, and encourage an employer to consider you for a specific position. Use traditional letter formatting: be sure to...

which elements from any ethical frameworks are used in the paris agreement

Assume that you have been hired as a consultant by CGT, a major producer of chemicals and plastics, including plastic grocery bags, styrofoam cups, and fertilizers, to estimate the firm's weighted...

Control (labelled behaviour in previous work): learners prefer to rely on their own initiative, or on the direction of an instructor. This has implications for the level of control required or...

Cognitive: learners are more subjective in the way they make decisions and solve problems based on personal judgements, or base their decision making more on logic and scientific approaches. This...

Receptivity: learners are predominantly receptive to practical stimuli or theoretical stimuli for learning depending on their cultural backgrounds and their experiences in national educational...