On the central path problem

DOI10.1016/j.tcs.2013.07.010zbMath1301.68242OpenAlexW2149460333MaRDI QIDQ393050

Jinhui Xu, Yongding Zhu

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.010

zbMATH Keywords

computational geometrycentral pathfarthest-path Voronoi diagramoutput sensitive

Mathematics Subject Classification ID

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

Related Items

A radius of robust feasibility for uncertain farthest Voronoi cells ⋮ On farthest Voronoi cells

Cites Work

• Unnamed Item
• Farthest line segment Voronoi diagrams
• The upper envelope of Voronoi surfaces and its applications
• Farthest-Polygon Voronoi Diagrams
• Improved Algorithms for Farthest Colored Voronoi Diagram of Segments
• The frechet distance revisited and extended