#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2000

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sharareh Alipour, Ebadollah S. Mahmoodian, E. Mollaahmadi
- Australasian J. Combinatorics
- 2000

The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph K(r, s, t) into 5-cycles was first considered by Mahmoodian and Mirzakhani (1995). They stated some necessary conditions and conjectured that these conditions are also sufficient. Since then, many cases of the problem have been solved by various authors;… (More)

- Sharareh Alipour, Alireza Zarei
- FAW-AAIM
- 2011

For a set of n disjoint line segments S in R, the visibility testing problem (VTP) is to test whether the query point p sees a query segment s ∈ S. For this configuration, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from any query point p can be computed quickly. In this paper, we solve VTP in… (More)

- Sharareh Alipour, Amir Jafari
- ArXiv
- 2017

In real applications, there are situations where we need to model some problems based on uncertain data. This leads us to define an uncertain model for some classical geometric optimization problems and propose algorithms to solve them. In this paper, we study the k-center problem, for uncertain input. In our setting, each uncertain point Pi is located… (More)

- Mojtaba Nouri Bygi, Shervin Daneshpajouh, Sharareh Alipour, Mohammad Ghodsi
- J. Computational Applied Mathematics
- 2015

For a simple polygon P of size n, we define weak visibility counting problem (WVCP) as finding the number of visible segments of P from a query line segment pq. We present different algorithms to compute WVCP in sub-linear time. In our first algorithm, we spend O(n) time to preprocess the polygon and build a data structure of size O(n), so that we can… (More)

- Thomas J. Dodd, Mian Ahsan, +18 authors Jason S. Ku
- 2014

We show it is NP-hard to compute a minimum cover of point 2-transmitters, point k-transmitters and edge 2-transmitters in a simple polygon; the point 2transmitter result extends to orthogonal polygons. Introduction. The traditional art gallery problem (AGP) considers placing guards in an art gallery—modeled by a polygon—such that every point in the room can… (More)

- Sharareh Alipour, Mohammad Ghodsi, Amir Jafari
- COCOON
- 2016

Given a set S of n disjoint line segments in R, the visibility counting problem (VCP) is to preprocess S such that the number of segments in S visible from any query point p can be computed quickly. This problem can trivially be solved in logarithmic query time using O(n) preprocessing time and space. Gudmundsson and Morin proposed a 2-approximation… (More)

For a set of n disjoint line segments S in R, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from a query point p can be computed quickly. This problem can be solved in logarithmic query time using O(n) preprocessing time and space. In this paper, we propose a randomized approximation algorithm for… (More)

- Sharareh Alipour, Mohammad Ghodsi, Ugur Güdükbay, Morteza Golkari
- 2014 International Conference on Computer Vision…
- 2014

Given a terrain and a query point p on or above it, we want to count the number of triangles of terrain that are visible from p. We present an approximation algorithm to solve this problem. We implement the algorithm and then we run it on the real data sets. The experimental results show that our approximation solution is very close to the real solution and… (More)

- Sharareh Alipour, Bahman Kalantari, Hamid Homapour
- ArXiv
- 2014

We consider approximation of diameter of a set S of n points in dimension m. Eg̃eciog̃lu and Kalantari [8] have shown that given any p ∈ S, by computing its farthest in S, say q, and in turn the farthest point of q, say q′, we have diam(S) ≤ √ 3 d(q, q′). Furthermore, iteratively replacing p with an appropriately selected point on the line segment pq, in at… (More)

- ‹
- 1
- ›