#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2009

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dania El-Khechen, Muriel Dulieu, John Iacono, Nikolaj van Omme
- CCCG
- 2009

In a packing problem, the goal is to put some small objects disjointly into a large container, while optimizing some objective function. The packing problem is very general, and a rich variety of… (More)

- Boris Aronov, Muriel Dulieu, Ferran Hurtado
- Comput. Geom.
- 2011

Introduction. Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis and use, see [6] for a survey. Examples of such… (More)

- Boris Aronov, Muriel Dulieu, Ferran Hurtado
- Comput. Geom.
- 2009

We consider a generalization of the Gabriel graph, the witness Gabriel graph. Given a set of vertices P and a set of witness points W in the plane, there is an edge ab between two points of P in the… (More)

- Greg Aloupis, Jean Cardinal, +10 authors Perouz Taslakian
- LATIN
- 2009

Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we… (More)

- Boris Aronov, Muriel Dulieu, Ferran Hurtado
- Graphs and Combinatorics
- 2014

In a witness rectangle graph (WRG) on vertex point set P with respect to witness point set W in the plane, two points x, y in P are adjacent whenever the open isothetic rectangle with x and y as… (More)

We consider the problem of computing an order type invariant labeling for a given set of n points. In 2D, such a labeling can be constructed in O(hn) time, where h is the size of the smallest convex… (More)

- Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir
- Electr. J. Comb.
- 2013

Let S be a set of n points in the plane, and let D be an arbitrary set of disks, each having a pair of points of S as a diameter. We show that the combinatorial complexity of the union of the disks… (More)

- Boris Aronov, Muriel Dulieu
- Comput. Geom.
- 2013

- Boris Aronov, Muriel Dulieu
- WADS
- 2011

A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two points x, y, are… (More)