23 citations · 51 across the 26 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.CG2013
Weak Visibility Queries of Line Segments in Simple Polygons and Polygonal Domains
Mojtaba Nouri Bygi, Mohammad Ghodsi
In this paper we consider the problem of computing the weak visibility polygon of any query line segment (or ) inside a given polygon . Our first non-trivial algor…
cs.CG2013★ 1 cited
Near Optimal Line Segment Weak Visibility Queries in Simple Polygons
Mojtaba Nouri Bygi, Mohammad Ghodsi
This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm t…
cs.CE2013
Constructing a genome assembly that has the maximum likelihood
Mohammadreza Ghodsi
We formulate genome assembly problem as an optimization problem in which the objective function is the likelihood of the assembly given the reads.