Paz Carmi

most citedOn the Stretch Factor of Convex Delaunay Graphs

3 citations · 9 across the 8 of their papers we have counts for

collaborators

Showing cs.CGShow all

6 papers · 1 filter

cs.CG2008

Communication-Efficient Construction of the Plane Localized Delaunay Graph

Prosenjit Bose, Paz Carmi, Michiel Smid +1

Let $V$ be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane $\frac{4 π 3}{9}$ -spanner of the unit-disk graph $\UDG(V)$. This algori…

cs.CG2008★ 3 cited

On the Stretch Factor of Convex Delaunay Graphs

Prosenjit Bose, Paz Carmi, Sebastien Collette +1

Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DG_C(S) of S is define…

cs.CG2008★ 1 cited

Spanners of Additively Weighted Point Sets

Prosenjit Bose, Paz Carmi, Mathieu Couture

We study the problem of computing geometric spanners for (additively) weighted point sets. A weighted point set is a set of pairs $(p, r)$ where $p$ is a point in the plane and $r$ …

cs.CG2007★ 1 cited

Spanners of Complete $k$ -Partite Geometric Graphs

Prosenjit Bose, Paz Carmi, Mathieu Couture +3

We address the following problem: Given a complete $k$ -partite geometric graph $K$ whose vertex set is a set of $n$ points in $R^{d}$ , compute a spanner of $K$ that has a ``…

cs.CG2007★ 2 cited

Geometric Spanners With Small Chromatic Number

Prosenjit Bose, Paz Carmi, Mathieu Couture +3

Given an integer $k \geq 2$ , we consider the problem of computing the smallest real number $t (k)$ such that for each set $P$ of points in the plane, there exists a $t (k)$ -spanner f…

cs.CG2007★ 2 cited

On a family of strong geometric spanners that admit local routing strategies

Prosenjit Bose, Paz Carmi, Mathieu Couture +2

We introduce a family of directed geometric graphs, denoted $\paz$, that depend on two parameters $λ$ and $θ$ . For $0 \leq θ < \frac{π}{2}$ and $1/2 < λ < 1$ , the $\paz$ graph is a str…