Minkowski Sum Selection and Finding
| dc.creator | Luo, Cheng-Wei | |
| dc.creator | Liu, Hsiao-Fei | |
| dc.creator | Chen, Peng-An | |
| dc.creator | Chao, Kun-Mao | |
| dc.date | 2008-09-06 | |
| dc.date.accessioned | 2026-07-07T10:01:17Z | |
| dc.date.available | 2026-07-07T10:01:17Z | |
| dc.description | For the \textsc{Minkowski Sum Selection} problem with linear objective functions, we obtain the following results: (1) optimal $O(n\log n)$ time algorithms for $λ=1$; (2) $O(n\log^2 n)$ time deterministic algorithms and expected $O(n\log n)$ time randomized algorithms for any fixed $λ>1$. For the \textsc{Minkowski Sum Finding} problem with linear objective functions or objective functions of the form $f(x,y)=\frac{by}{ax}$, we construct optimal $O(n\log n)$ time algorithms for any fixed $λ\geq 1$. | |
| dc.description | 23 pages, 10 figures, accepted by ISAAC 2008 | |
| dc.identifier | https://arxiv.org/abs/0809.1171 | |
| dc.identifier | http://arxiv.org/abs/0809.1171 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168585 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | Computational Geometry | |
| dc.title | Minkowski Sum Selection and Finding | |
| dc.type | text |