Pareto envelopes in simple polygons

DOI10.1142/S0218195910003499zbMATH Open1218.52012OpenAlexW2140604725MaRDI QIDQ3070044FDOQ3070044

Authors: Victor Chepoi, Karim Nouioua, Edouard Thiel, Yann Vaxès 

Publication date: 2 February 2011

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195910003499

Recommendations

• scientific article; zbMATH DE number 3905341
• Fast algorithms for direct enclosures and direct dominances
• scientific article; zbMATH DE number 3910156
• Convex hulls in polygonal domains
• scientific article; zbMATH DE number 177850

zbMATH Keywords

algorithmdominancesimple polygongeodesic \(l_{1}\)- and \(l_{2}\)-distancePareto envelope

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mathematical programming (90C99)

Cites Work

• A note on Fermat's problem
• Title not available (Why is that?)
• Triangulating a simple polygon in linear time
• Optimal Search in Planar Subdivisions
• On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
• Location Theory, Dominance, and Convexity
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Computing a median point of a simple rectilinear polygon
• Optimal Point Location in a Monotone Subdivision
• Some Properties of Location Problems with Block and Round Norms
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• Sets of efficient points in a normed space
• Finding efficient solutions for rectilinear distance location problems efficiently
• Determination of efficient points in multiple-objective location problems
• Matrix Searching with the Shortest-Path Metric
• Computing the geodesic center of a simple polygon
• Computing geodesic furthest neighbors in simple polygons
• A rounding algorithm for approximating minimum Manhattan networks

Cited In (2)

• Title not available (Why is that?)
• Monotone discretizations of levelset convex geometric PDEs

This page was built for publication: Pareto envelopes in simple polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070044)