Sahar Mehrpour

activity

20172019

collaborators

3 papers

cs.CG2019

Pseudo-Triangle Visibility Graph: Characterization and Reconstruction

Sahar Mehrpour, Alireza Zarei

The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its vi…

cs.CG2018

Polygon Simplification by Minimizing Convex Corners

Yeganeh Bahoo, Stephane Durocher, J. Mark Keil +3

Let $P$ be a polygon with $r > 0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P^{'}$ such that $P \subseteq P^{'}$ , each connected compone…

cs.CG2017

Exploring Increasing-Chord Paths and Trees

Yeganeh Bahoo, Stephane Durocher, Sahar Mehrpour +1

A straight-line drawing $Γ$ of a graph $G = (V, E)$ is a drawing of $G$ in the Euclidean plane, where every vertex in $G$ is mapped to a distinct point, and every edge in $G$ is mappe…