What is the running time of the algorithm

Reference no: EM132699581

Question: 1. In this chapter we have looked at the point location problem with pre- processing. We have not looked at the single shot problem, where the subdivision and the query point are given at the same time, and we have no special preprocessing to speed up the searches. In this exercise and some of the following ones, we have a look at such problems.

Given a simple polygon P with n vertices and a query point q, here is an algorithm to determine whether q lies in P. Consider the ray ρ := {(qx +λ,qy) : λ > 0} (this is the horizontal ray starting in q and going rightwards). Determine for every edge e of P whether it intersects ρ. If the number of intersecting edges is odd, then q ∈ P, otherwise q à∈ P.

Prove that this algorithm is correct, and explain how to deal with degen- erate cases. (One degenerate case is when ρ intersects an endpoint of an edge. Are there other special cases?) What is the running time of the algorithm?

2. Suppose you are given an n-vertex simple polygon, P. Describe how to build an efficient data structure for determining in O(log n) time whether a query point, q, is inside of P or not. What is the space and preprocessing time for your data structure?

3. The ray shooting problem occurs in computer graphics (see Chapter 8). A 2-dimensional version can be given as follows: Store a set S of n non-crossing line segments such that one can quickly answer queries of the type: "Given a query ray ρ-a ray is a half-line starting at some point-find the first segment in S intersected by ρ." (We leave it to you to define the behavior for degenerate cases.) In this exercise, we look at vertical ray shooting, where the query ray must be a vertical ray pointing upwards. Only the starting point need be specified in such a query. Give a data structure for the vertical ray shooting problem for a set S of n non-crossing line segments in general position. Bound the query time and storage requirement of your data structure. What is the preprocessing time?

Reference no: EM132699581

Questions Cloud

Describe the research paradigm in brief : Review your notes from class on the different methodologies and instruments used to measure. Also, review the examples via the links here Approaches Expectation

Write a paper on the future of digital currency litigation : Prepare a 3-5 page paper on the future of digital currency litigation and the implications for taxation. What are the pros and cons? How will this ultimately.

Research project on the surveillance state : Your Research Project on the surveillance state consists of two parts: 750 word research paper with at least 3 sources. There should be no lists.

What actions must be taken in response to security incident : What actions must be taken in response to a security incident? What is computer forensics, and what role does it play in responding to a computer incident?

What is the running time of the algorithm : In this chapter we have looked at the point location problem with pre- processing. We have not looked at the single shot problem, where the subdivision.

Discussion on the topic search engine and optimization : Topic: Search Engine And Optimization (research paper) need to work at least 750 words. Chapter 3 is considered to be the CORE of the research study you will.

Why this oauth is important for your peers to understand : Write 500 words or more explaining why this "OAuth" is important for your peers to understand. Be focused and specific. You should do a deep dive into a topic.

What about services that have largely been ignored : Forecasting provides very useful projections for established products and services, but newly introduced products and services have wildly different success.

Analyze asymmetric and symmetric encryption : You will analyze asymmetric and symmetric encryption. Evaluate the differences between the two of them and which one that you would determine is the most.

User Account

All Pages