Parametric search: three new applications

DOI10.1007/S11464-009-0049-XMaRDI QIDQ2266831zbMATH OpenOpenAlexFDO

Authors Wencheng Wang, Binhai Zhu, Naoki Katoh, Yinfeng 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

zbMATH Keywords

facility locationgeometric optimizationparametric search

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1182930
• Applications of Parametric Searching in Geometric Optimization
• scientific article; zbMATH DE number 742950
• On nonlinear parametric search
• Minimax parametric optimization problems and multi-dimensional parametric searching

Cites work

• A constant-factor approximation algorithm for optimal terrain guarding
• A linear algorithm for computing the visibility polygon from a point
• A near-linear algorithm for the planar 2-center problem
• An optimal approximation algorithm for the rectilinear m-center problem
• An optimal parallel algorithm for the visibility of a simple polygon from a point
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
• Corrections to Lee's visibility polygon algorithm
• Guarding a terrain by two watchtowers
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 1796960 (Why is no real title available?)
• scientific article; zbMATH DE number 742950 (Why is no real title available?)
• scientific article; zbMATH DE number 6472586 (Why is no real title available?)
• Improved approximation algorithms for geometric set cover
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• More planar two-center algorithms
• On the correctness of a linear-time visibility polygon algorithm^∗
• Parametric search made practical
• Slowing down sorting networks to obtain faster sorting algorithms
• The 2-center problem with obstacles
• The discrete 2-center problem
• Visibility of a simple polygon

Cited in

(9)

• Acrophobic guard watchtower problem
• Applications of Parametric Searching in Geometric Optimization
• scientific article; zbMATH DE number 1182930 (Why is no real title available?)
• Parametric search made practical
• scientific article; zbMATH DE number 742950 (Why is no real title available?)
• On nonlinear parametric search
• Parametric search made practical
• Guarding precise and imprecise polyhedral terrains with segments
• Guarding terrains with guards on a line

This page was built for publication: Parametric search: three new applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266831)