1. Engineering
  2. Computer Science
  3. given a set of n points such that point pi...

Question: given a set of n points such that point pi...

Question details

Given a set of n points such that point pi has weight wi, for 1 <= i <= n

(a) If the point set exists in one dimension, describe how a 1-d range tree can be adapted to report the point of minimum weight in a given query range in O(log n) time. Prove the query time bound.

(b) Repeat part (a) for the case where the given set of points exists in 2-dimensions and prove a O(log2n) query time.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution