Given a set of buildings, the skyline is the silhouetted shape formed by the highest boundaries of the buildings viewed from a distance. In this problem, we will compute the skyline of a set of buildings represented by rectangles. For an illustrative example, consider the set of rectangles in Figure 1 and their skyline. The input is a list B of rectangles in the format B = [(s, e, h.), (S2, e2, h:)... (Sa, en, h.)]. For each rectangle Bi E B, the first two coordinates s; and e, are the horizontal bounds; the rectangle begins at s and ends at e. The third coordinate hi is the height of the rectangle. The output should be an ordered list of coordinates P = [(xo, 0), (xı, h.), (x2, h.) ... (x;, 0)]. A pair (x, hi) indicates that (horizontally) from xi to x-1, the height of the skyline will be hi; from x+1 to X2 the height will be h+1, and so on. Note that the first and last items in this list are both at ground level. Describe an efficient algorithm which computes the skyline of B. You may assume that all rectangles have distinct heights and that no two rectangles are exactly the same. %3D

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Given a set of buildings, the skyline is the silhouetted shape formed by the highest boundaries of the
buildings viewed from a distance. In this problem, we will compute the skyline of a set of buildings
represented by rectangles.
For an illustrative example, consider the set of rectangles in Figure 1 and their skyline.
The input is a list B of rectangles in the format B = [(s1, e1, h), (s2, e2, h:) . .. (Sn, en, ha)].
For each rectangle Bi E B, the first two coordinates s; and e; are the horizontal bounds; the rectangle
begins at s, and ends at e. The third coordinate hi is the height of the rectangle.
The output should be an ordered list of coordinates P = [(Xo, 0), (x1, hì), (x2, ha) ... (x;, 0)]. A pair
(Xi, hi) indicates that (horizontally) from xi to x1, the height of the skyline will be hi; from x+1
to X+2 the height will be h1, and so on. Note that the first and last items in this list are both at
ground level.
Describe an efficient algorithm which computes the skyline of B. You may assume that all rectangles
have distinct heights and that no two rectangles are exactly the same.
•.
li+1,
Transcribed Image Text:Given a set of buildings, the skyline is the silhouetted shape formed by the highest boundaries of the buildings viewed from a distance. In this problem, we will compute the skyline of a set of buildings represented by rectangles. For an illustrative example, consider the set of rectangles in Figure 1 and their skyline. The input is a list B of rectangles in the format B = [(s1, e1, h), (s2, e2, h:) . .. (Sn, en, ha)]. For each rectangle Bi E B, the first two coordinates s; and e; are the horizontal bounds; the rectangle begins at s, and ends at e. The third coordinate hi is the height of the rectangle. The output should be an ordered list of coordinates P = [(Xo, 0), (x1, hì), (x2, ha) ... (x;, 0)]. A pair (Xi, hi) indicates that (horizontally) from xi to x1, the height of the skyline will be hi; from x+1 to X+2 the height will be h1, and so on. Note that the first and last items in this list are both at ground level. Describe an efficient algorithm which computes the skyline of B. You may assume that all rectangles have distinct heights and that no two rectangles are exactly the same. •. li+1,
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 5 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY