20 citations · 20 across the 5 of their papers we have counts for
10 papers
Theoretical analysis of beaconless geocast protocols in 1D
Joachim Gudmundsson, Irina Kostitsyna, Maarten Löffler +3
Beaconless geocast protocols are routing protocols used to send messages in mobile ad-hoc wireless networks, in which the only information available to each node is its own locatio…
Efficient Fréchet distance queries for segments
Maike Buchin, Ivor van der Hoog, Tim Ophelders +3
We study the problem of constructing a data structure that can store a two-dimensional polygonal curve , such that for any query segment one can efficiently comp…
Affine invariant triangulations
Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira
We study affine invariant 2D triangulation methods. That is, methods that produce the same triangulation for a point set for any (unknown) affine transformation of . Our wor…
New production matrices for geometric graphs
Guillermo Esteban, Clemens Huemer, Rodrigo I. Silveira
We use production matrices to count several classes of geometric graphs. We present novel production matrices for non-crossing partitions, connected geometric graphs, and k-angulat…
A new lower bound on the maximum number of plane graphs using production matrices
Clemens Huemer, Alexander Pilz, Rodrigo I. Silveira
We use the concept of production matrices to show that there exist sets of points in the plane that admit crossing-free geometric graphs. This improves the previou…
Matching points with disks with a common intersection
Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara +1
We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and…