PARETO ENVELOPES IN SIMPLE POLYGONS
From MaRDI portal
Publication:3070044
DOI10.1142/S0218195910003499zbMath1218.52012OpenAlexW2140604725MaRDI QIDQ3070044
Edouard Thiel, Victor Chepoi, Karim Nouioua, 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
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Mathematical programming (90C99)
Cites Work
- Unnamed Item
- Computing the geodesic center of a simple polygon
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Sets of efficient points in a normed space
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Finding efficient solutions for rectilinear distance location problems efficiently
- Triangulating a simple polygon in linear time
- Computing a median point of a simple rectilinear polygon
- Computing geodesic furthest neighbors in simple polygons
- A rounding algorithm for approximating minimum Manhattan networks
- Some Properties of Location Problems with Block and Round Norms
- Optimal Point Location in a Monotone Subdivision
- Determination of efficient points in multiple-objective location problems
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Optimal Search in Planar Subdivisions
- Matrix Searching with the Shortest-Path Metric
- A note on Fermat's problem
- Location Theory, Dominance, and Convexity
This page was built for publication: PARETO ENVELOPES IN SIMPLE POLYGONS