A dynamic dictionary for priced information with application
In this paper we design a dynamic dictionary for the priced information model initiated by [2,3]. Assume that a set S consisting of n elements is given such that each element has an associated price, a positive real number. The cost of performing an operation on elements of S is a function of their prices. The cost of an algorithm is the sum of the costs of all operations it performs. The objective is to design algorithms which incur low cost. In this model, we propose a dynamic dictionary, supporting insert, delete, and search for keys drawn from a linearly ordered set. As an application we show that the dictionary can be used in computing the trapezoidal map of a set of line segments.
|Organisation||Computational Geometry Lab|
Maheshwari, A, & Smid, M. (2003). A dynamic dictionary for priced information with application.