Sharif Digital Repository

We study the problem of approximating a function F:ℝ → ℝ by a piecewise-linear function F̄ when the values of F at {x 1,...,xn} are given by a discrete probability distribution. Thus, for each xi we are given a discrete set y i,1,..., yi,mi of possible function values with associated probabilities pi,j such that Pr[F(xi) = yi,j] = pi,j. We define the error of F̄ as error(F, F̄) = maxi=1n E[|Fxi) - F̄(xi)|]. Let m = ∑i=1nmi be the total number of potential values over all F(xi). We obtain the following two results: (i) an O(m) algorithm that, given F and a maximum error ε, computes a function F̄ with the minimum number of links such that error(F, F̄) ≤ ε; (ii) an O(n4/3+δ + mlogn) algorithm... 

For a given set of n colored points with k colors in the plane, we study the problem of computing the smallest color-spanning axis-parallel square. First, for a dynamic set of colored points on the real line, we propose a dynamic structure with O(log2 n) update time per insertion and deletion for maintaining the smallest color-spanning interval. Next, we use this result to compute the smallest color-spanning square. Although we show there could be Ω(kn) minimal color-spanning squares, our algorithm runs in O(nlog2 n) time and O(n) space  

We study a variant of the problem of spanning colored objects where the goal is to span colored objects with two similar regions. We dedicate our attention in this paper to the case where objects are points lying on the real line and regions are intervals. Precisely, the goal is to compute two intervals together spanning all colors. As the main ingredient of our algorithm, we first introduce a kinetic data structure to keep track of minimal intervals spanning all colors. Then we present a novel algorithm using the proposed KDS to compute a pair of intervals which together span all the colors with the property that the largest one is as small as possible. The algorithm runs in O(n2 log n)... 

Suppose n colored points with k colors in Rd are given. The Smallest Color-Spanning Ball (SCSB) is the smallest ball containing at least one point of each color. As the computation of the SCSB in Lp metric (p≥1) is time-consuming, we focus on approximately computing the SCSB in near-linear time. Initially, we propose a 3-approximation algorithm running in O(n logn) time. This algorithm is then utilized to present a (1+ε)-approximation algorithm with the running time of O((1/ε)dn logn). We improve the running time to O((1/ε)dn) using randomized techniques. Afterward, spanning colors with two balls is studied. For a special case where d=1, there is an algorithm with O(n2) time. We demonstrate... 

The energy efficiency of emerging nonvolatile processors equipped with FRAM-SRAM memory makes them a promising solution for energy harvesting systems. To enable correct functionality and forward progress with an unreliable power supply, the system must accumulate sufficient energy in the capacitor to execute tasks atomically, even in the worst case scenario. Due to the large gap between the average and worst case energy consumption of tasks, state of the art approaches like eM-map require a large capacitor to execute tasks on the SRAM. However, the size, cost, and charging time of the capacitor are major concerns in the energy harvesting systems. In this paper, we proposed CHANCE, a... 

The energy efficiency of emerging nonvolatile processors equipped with FRAM-SRAM memory makes them a promising solution for energy harvesting systems. To enable correct functionality and forward progress with an unreliable power supply, the system must accumulate sufficient energy in the capacitor to execute tasks atomically, even in the worst case scenario. Due to the large gap between the average and worst case energy consumption of tasks, state-of-the-art approaches like eM-map require a large capacitor to execute tasks on the SRAM. However, the size, cost, and charging time of the capacitor are major concerns in the energy harvesting systems. In this article, we proposed CHANCE, a... 

We construct a new proximity graph, called the Pie Delaunay graph, on a set of n points which is a super graph of Yao graph and Euclidean minimum spanning tree (EMST). We efficiently maintain the Pie Delaunay graph where the points are moving in the plane. We use the kinetic Pie Delaunay graph to create a kinetic data structure (KDS) for maintenance of the Yao graph and the EMST on a set of n moving points in 2-dimensional space. Assuming x and y coordinates of the points are defined by algebraic functions of at most degree s, the structure uses O(n) space, O(nlogn) preprocessing time, and processes O(n 2 λ 2s∈+∈2(n)β s + 2(n)) events for the Yao graph and O(n 2 λ 2s + 2(n)) events for the... 

Let (Formula presented.) be a set of n points inside a polygonal domain (Formula presented.). A polygonal domain with h holes (or obstacles) consists of h disjoint polygonal obstacles surrounded by a simple polygon which itself acts as an obstacle. We first study t-spanners for the set (Formula presented.) with respect to the geodesic distance function (Formula presented.) where for any two points p and q, (Formula presented.) is equal to the Euclidean length of the shortest path from p to q that avoids the obstacles interiors. For a case where the polygonal domain is a simple polygon (i.e., (Formula presented.)), we construct a ((Formula presented.))-spanner that has (Formula presented.)... 

Let P be a set of n points inside a polygonal domain D. A polygonal domain with h holes (or obstacles) consists of h disjoint polygonal obstacles surrounded by a simple polygon which itself acts as an obstacle. We first study t-spanners for the set P with respect to the geodesic distance function π where for any two points p and q, π(p, q) is equal to the Euclidean length of the shortest path from p to q that avoids the obstacles interiors. For a case where the polygonal domain is a simple polygon (i.e., h= 0), we construct a (10+ϵ)-spanner that has O(nlog 2n) edges. For a case where there are h holes, our construction gives a (5 + ϵ)-spanner with the size of O(nhlog2n). Moreover, we study... 

We study the collision detection of n moving balls of arbitrary sizes in 3-dimensional space. We improve both the storage and the event-handling time of the best existing KDS [1] by several logarithmic factors. Precisely, our KDS maintains O(n) certificates at the current time, uses O(nlog2⁡n) storage, handles each event in O(log3⁡n) time, and processes O(n2) events in the worst case, assuming that the balls follow constant-degree algebraic trajectories. © 2021 Elsevier B.V  

This study revisited the problem of online con ict-free coloring of intervals on a line, where each newly inserted interval must be assigned a color upon insertion such that the coloring remains conflict-free, i.e., for each point p in the union of the current intervals, there must be an interval I with a unique color among all intervals covering p. The bestknown algorithm uses O(log3 n) colors, where n is the number of current intervals. A simple greedy algorithm was presented that used only O(log n) colors. Therefore, the open problem raised in [Abam, M.A., Rezaei Seraji, M.J., and Shadravan, M. "Online conflictfree coloring of intervals", Journal of Scientia Iranica, 21(6), pp. 2138{2141... 

We study the collision detection of n moving balls of arbitrary sizes in 3-dimensional space. We improve both the storage and the event-handling time of the best existing KDS [1] by several logarithmic factors. Precisely, our KDS maintains O(n) certificates at the current time, uses O(nlog2⁡n) storage, handles each event in O(log3⁡n) time, and processes O(n2) events in the worst case, assuming that the balls follow constant-degree algebraic trajectories. © 2021 Elsevier B.V  

For a set of colored points, a region is called color-spanning if it contains at least one point of each color. In this paper, we first consider the problem of maintaining the smallest color-spanning interval for a set of n points with k colors on the real line, such that the insertion and deletion of an arbitrary point takes O(log2 n) the worst-case time. Then, we exploit the data structure to show that there is O(n log2 n) time algorithm to compute the smallest color-spanning square for a set of n points with k colors in the plane. This is a new way to improve O(nk log n) time algorithm presented by Abellanas et al. [1] when k = !(log n). We also consider the problem of computing the... 

Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any axis-parallel line segment inside P. We present a 3-approximation algorithm for the problem of finding a partition with minimum stabbing number. It is based on an algorithm that finds an optimal partition for histograms. We also study Steiner triangulations of a simple (nonrectilinear) polygon P. Here the stabbing number is defined as the maximum number of triangles that can be stabbed by any line segment inside P. We give an O(1)-approximation algorithm for the problem of computing a Steiner triangulation with minimum stabbing number  

We study the following variant of the well-known line-simplification problem: we are getting a (possibly infinite) sequence of points p0,p1,p2,... in the plane defining a polygonal path, and as we receive the points, we wish to maintain a simplification of the path seen so far. We study this problem in a streaming setting, where we only have a limited amount of storage, so that we cannot store all the points. We analyze the competitive ratio of our algorithms, allowing resource augmentation: we let our algorithm maintain a simplification with 2k (internal) points and compare the error of our simplification to the error of the optimal simplification with k points. We obtain the algorithms... 

We study the following variant of the well-known line-simpli- ficationproblem: we are getting a possibly infinite sequence of points p 0,p1,p2,... in the plane defining a polygonal path, and as wereceive the points we wish to maintain a simplification of the pathseen so far. We study this problem in a streaming setting, where weonly have a limited amount of storage so that we cannot store all thepoints. We analyze the competitive ratio of our algorithms, allowingresource augmentation: we let our algorithm maintain a simplificationwith 2k (internal) points, and compare the error of oursimplification to the error of the optimal simplification with k points. We obtain the algorithms with O(1)... 

Consider a scenario in which several agents are located in the Euclidean space, and the agents want to create a network in which everyone has fast access to all or some other agents. Geometric t-spanners are examples of such a network providing fast connections between the nodes of the network for some fixed value t, i.e. the length of the shortest path between any two nodes in the network is at most t times their Euclidean distance. Geometric t-spanners have been extensively studied in the area of computational geometry where they are created by a central authority. In this paper, we investigate a situation in which selfish agents want to create such a network in the absence of a central... 

Given a translating and rotating rod robot in a plane in the presence of polygonal obstacles with the initial and final placements of the rod known, the d1-optimal motion planning problem is defined as finding a collision-free motion of the rod such that the orbit length of a fixed but arbitrary point F on the rod is minimized. In this paper we study a special case of this problem in which the rod can translate freely, but can only rotate by some pre-specified given angles around F. We first characterize the d1-optimal motion of the robot under the given conditions and then present a (1 + ε)-approximation algorithm for finding the optimal path. The running time of the algorithm is bounded by... 

We introduce the concept of local spanners for planar point sets with respect to a family of regions, and prove the existence of local spanners of small size for some families. For a geometric graph G on a point set P and a region R belonging to a family R, we define G∩ R to be the part of the graph G that is inside R (or is induced by R). A local t-spanner w.r.t R is a geometric graph G on P such that for any region R∈ R, the graph G∩ R is a t-spanner for K(P) ∩ R, where K(P) is the complete geometric graph on P. For any set P of n points and any constant ε> 0 , we prove that P admits local (1 + ε) -spanners of sizes O(nlog 6n) and O(nlog n) w.r.t axis-parallel squares and vertical slabs,... 

We introduce the concept of local spanners for planar point sets with respect to a family of regions, and prove the existence of local spanners of small size for some families. For a geometric graph G on a point set P and a region R belonging to a family R, we define G∩ R to be the part of the graph G that is inside R (or is induced by R). A local t-spanner w.r.t R is a geometric graph G on P such that for any region R∈ R, the graph G∩ R is a t-spanner for K(P) ∩ R, where K(P) is the complete geometric graph on P. For any set P of n points and any constant ε> 0 , we prove that P admits local (1 + ε) -spanners of sizes O(nlog 6n) and O(nlog n) w.r.t axis-parallel squares and vertical slabs,...