
Expected Complexity of Routing in Θ 6 and HalfΘ 6 Graphs
We study online routing algorithms on the Θ6graph and the halfΘ6graph...
read it

Convex Polygons in Cartesian Products
We study several problems concerning convex polygons whose vertices lie ...
read it

Stabbing Pairwise Intersecting Disks by Four Points
Following the seminal works of Danzer (1956, 1986) and Stachó (1965,1981...
read it

On the Minimum Consistent Subset Problem
Let P be a set of n colored points in the plane. Introduced by Hart (196...
read it

On the Spanning and Routing Ratio of ThetaFour
We present a routing algorithm for the Theta4graph that computes a pat...
read it

Reconstructing a convex polygon from its ωcloud
An ωwedge is the (closed) set of all points contained between two rays ...
read it

The Geodesic 2center Problem in a Simple Polygon
The geodesic kcenter problem in a simple polygon with n vertices consis...
read it

Optimal Art Gallery Localization is NPhard
Art Gallery Localization (AGL) is the problem of placing a set T of broa...
read it

Art Gallery Localization
We study the problem of placing a set T of broadcast towers in a simple ...
read it

The Shadows of a Cycle Cannot All Be Paths
A "shadow" of a subset S of Euclidean space is an orthogonal projection ...
read it

Similarity of Polygonal Curves in the Presence of Outliers
The Fréchet distance is a well studied and commonly used measure to capt...
read it
JeanLou De Carufel
is this you? claim profile