no code implementations • 7 Apr 2014 • Guillermo Ruiz, Edgar Chávez
We call $G$ a {\em proximal navigation graph} or $PN$-graph if for each edge $(u, v) \in E$ either $u=v$ or there is a node $u_1$ such that $(u, u_1) \in E$ and $\mathbf{d}(u, v) > \mathbf{d}(u_1, v)$.
Computational Geometry
no code implementations • 18 Apr 2013 • Edgar Chávez, Ana C. Chávez-Cáliz, Jorge L. López-López
Given a collection $\{Z_1, Z_2,\ldots, Z_m\}$ of $n$-sided polygons in the plane and a query polygon $W$ we give algorithms to find all $Z_\ell$ such that $W=f(Z_\ell)$ with $f$ an unknown similarity transformation in time independent of the size of the collection.
