An efficient algorithm for the 2-central path problem

DOI10.1142/S0218195924500031MaRDI QIDQ6966335zbMATH OpenFDO

Authors Ziyun Huang, Yongding Zhu, Jinhui Xu

Publication date 30 June 2025

Published in International Journal of Computational Geometry \& Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195924500031

zbMATH Keywords

\(2\)-central pathMinkowski sumparametric search

Mathematics Subject Classification ID

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

Cites work

• A faster algorithm for the two-center decision problem
• Applications of Parametric Searching in Geometric Optimization
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial optimization with rational objective functions
• Farthest-Polygon Voronoi Diagrams
• Finding the upper envelope of n line segments in O(n log n) time
• scientific article; zbMATH DE number 6472586 (Why is no real title available?)
• Improved algorithms for farthest colored Voronoi diagram of segments
• Median trajectories
• More planar two-center algorithms

This page was built for publication: An efficient algorithm for the 2-central path problem

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