Pareto Envelopes in Simple Polygons

Victor Chepoi (1) , Karim Nouioua (1) , Edouard Thiel (1) , Yann Vaxès (1)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille

For a set T of n points in a metric space (X, d), a point y ∈ X is dominated by a point x ∈ X if d(x, t) ≤ d(y, t) for all t ∈ T and there exists t′ ∈ T such that d(x, t′) < d(y, t′). The set of nondominated points of X is called the Pareto envelope of T. H. Kuhn (1973) established that in Euclidean spaces, the Pareto envelopes and the convex hulls coincide. Chalmet et al. (1981) characterized the Pareto envelopes in the rectilinear plane (R2, d1) and constructed them in O(n log n) time. In this note, we investigate the Pareto envelopes of point-sets in simple polygons P endowed with geodesic d2- or d1-metrics (i.e., Euclidean and Manhattan metrics). We show that Kuhn’s characterization extends to Pareto envelopes in simple polygons with d2-metric, while that of Chalmet et al. extends to simple rectilinear polygons with d1-metric. These characterizations provide efficient algorithms for construction of these Pareto envelopes.

Mots clés: Pareto envelope; dominance; geodesic $l_1$- and $l_2$-distance; simple polygon; algorithm.

Domaines: Géométrie algorithmique [cs.CG]; Algorithme et structure de données [cs.DS]

Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès. Pareto Envelopes in Simple Polygons. International Journal of Computational Geometry and Applications, 2010, 20 (6), pp.707-721. ⟨10.1142/S0218195910003499⟩. ⟨hal-01192933⟩