Parametric search: three new applications
From MaRDI portal
Publication:2266831
DOI10.1007/s11464-009-0049-xzbMath1191.68766OpenAlexW2131140780MaRDI QIDQ2266831
Wencheng Wang, Binhai Zhu, Naoki Katoh, Yin-Feng Xu
Publication date: 26 February 2010
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-009-0049-x
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric search made practical
- An optimal approximation algorithm for the rectilinear m-center problem
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Corrections to Lee's visibility polygon algorithm
- The discrete 2-center problem
- A near-linear algorithm for the planar 2-center problem
- More planar two-center algorithms
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
- The 2-Center Problem with Obstacles
- Visibility of a simple polygon
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- A linear algorithm for computing the visibility polygon from a point
- On the correctness of a linear-time visibility polygon algorithm∗
- An optimal parallel algorithm for the visibility of a simple polygon from a point
- Slowing down sorting networks to obtain faster sorting algorithms
- Improved approximation algorithms for geometric set cover
- Guarding a terrain by two watchtowers
