Optimization on directionally convex sets
From MaRDI portal
Publication:1022414
DOI10.1007/s10100-008-0074-yzbMath1163.90698OpenAlexW2042500685MaRDI QIDQ1022414
Publication date: 22 June 2009
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-008-0074-y
Cites Work
- Unnamed Item
- On the X-Y convex hull of a set of X-Y polygons
- Restricted-oriented convex sets
- On Some Distance Problems in Fixed Orientations
- Optimal algorithms to compute the closure of a set of iso-rectangles
- Dynamic C-oriented polygonal intersection searching
- New Upper Bounds in Klee’s Measure Problem
- Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
- On L n Sets, the Hausdorff Metric, and Connectedness
This page was built for publication: Optimization on directionally convex sets