#### Filter Results:

- Full text PDF available (33)

#### Publication Year

2009

2018

- This year (15)
- Last 5 years (33)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mark de Berg, Stephane Durocher, Saeed Mehrabi
- COCOA
- 2014

A sliding camera in an orthogonal polygon P is a point guard g that travels back and forth along an orthogonal line segment s inside P . A point p in P is guarded by g if and only if there exists aâ€¦ (More)

- Stephane Durocher, Omrit Filtser, Robert Fraser, Ali D. Mehrabi, Saeed Mehrabi
- Comput. Geom.
- 2011

Let P be an orthogonal polygon with n vertices. A sliding camera travels back and forth along an orthogonal line segment s âŠ† P corresponding to its trajectory. The camera sees a point p âˆˆ P if thereâ€¦ (More)

- Stephane Durocher, Pak Ching Li, Saeed Mehrabi
- CCCG
- 2015

A 1.5-dimensional terrain T with n vertices is an xmonotone polygonal chain in the plane. A point guard p on T guards a point q of T if the line segment connecting p to q lies on or above T ; p is aâ€¦ (More)

- Vinod Kaggal, Ravikumar Komandur Elayavilli, +10 authors Hongfang Liu
- Biomedical informatics insights
- 2016

The concept of optimizing health care by understanding and generating knowledge from previous evidence, ie, the Learning Health-care System (LHS), has gained momentum and now has national prominence.â€¦ (More)

- Stephane Durocher, Saeed Mehrabi
- MFCS
- 2013

Let P be an orthogonal polygon. Consider a sliding camera that travels back and forth along an orthogonal line segment s âŠ† P as its trajectory. The camera can see a point p âˆˆ P if there exists aâ€¦ (More)

- Luis Barba, Stephane Durocher, +6 authors Mohammad Abdul Wahid
- CCCG
- 2013

We introduce the exact coloured k-enclosing object problem: given a set P of n points in R, each of which has an associated colour in {1, . . . , t}, and a vector c = (c1, . . . , ct), where ci âˆˆ Zâ€¦ (More)

- Stephane Durocher, Saeed Mehrabi
- COCOON
- 2012

The stabbing number of a partition of a rectilinear polygon P into rectangles is the maximum number of rectangles stabbed by any axis-parallel line segment contained in P . We consider the problem ofâ€¦ (More)

- Saeed Mehrabi
- ArXiv
- 2017

A graph G is called Bk-VPG (resp., Bk-EPG), for some constant k â‰¥ 0, if it has a string representation on a grid such that each vertex is an orthogonal path with at most k bends and two vertices areâ€¦ (More)

- Stephane Durocher, Stefan Felsner, Saeed Mehrabi, Debajyoti Mondal
- LATIN
- 2014

A strict orthogonal drawing of a graph G = (V,E) in R is a drawing of G such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal or vertical line segment. A graph Gâ€¦ (More)

- Saeed Mehrabi
- WAOA
- 2017