Pareto envelopes in simple polygons
From MaRDI portal
Publication:3070044
Recommendations
Cites work
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- A note on Fermat's problem
- A rounding algorithm for approximating minimum Manhattan networks
- Computing a median point of a simple rectilinear polygon
- Computing geodesic furthest neighbors in simple polygons
- Computing the geodesic center of a simple polygon
- Determination of efficient points in multiple-objective location problems
- Finding efficient solutions for rectilinear distance location problems efficiently
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Location Theory, Dominance, and Convexity
- Matrix Searching with the Shortest-Path Metric
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Sets of efficient points in a normed space
- Some Properties of Location Problems with Block and Round Norms
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Triangulating a simple polygon in linear time
Cited in
(2)
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)