Approximate Euclidean shortest paths in polygonal domains

Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input parameter $\epsilon$. We utilize $\Omega$ to compute a $(1+\epsilon)$-approximate geodesic shortest path between the two given points in $O(n + h((\lg{n}) + (\lg{h})^{1+\delta} + (\frac{1}{\epsilon}\lg{\frac{h}{\epsilon}})))$ time. Here, $\epsilon$ is a user parameter, and $\delta$ is a small positive constant (resulting from the time for triangulating the free space of $\cal P$ using the algorithm in \cite{journals/ijcga/Bar-YehudaC94}). Moreover, we devise a $(2+\epsilon)$-approximation algorithm to answer two-point Euclidean distance queries for the case of convex polygonal obstacles.Comment: a few updates; accepted to ISAAC 201

Modeling with SpecCharts

SpecCharts is a language intended for system level description and synthesis. It is based on hierarchical state diagrams, posseses many constructs designed to facilitate ease of system level descriptions, and is simulatable via a translator from SpecCharts to VHDL. To test the feasability of using the language, several examples were modeled using SpecCharts, were converted to VHDL, and simulated to verify correctness. The details of two of those examples are provided in this report

Emergence of (bi)multi-partiteness in networks having inhibitory and excitatory couplings

(Bi)multi-partite interaction patterns are commonly observed in real world systems which have inhibitory and excitatory couplings. We hypothesize these structural interaction pattern to be stable and naturally arising in the course of evolution. We demonstrate that a random structure evolves to the (bi)multi-partite structure by imposing stability criterion through minimization of the largest eigenvalue in the genetic algorithm devised on the interacting units having inhibitory and excitatory couplings. The evolved interaction patterns are robust against changes in the initial network architecture as well as fluctuations in the interaction weights.Comment: 6 pages, 7 figure