Optimal algorithms for some intersection radius problems

DOI10.1007/BF02246508zbMath0923.68117MaRDI QIDQ1332347

S. Jadhav, Jean-Marc Robert, A. Mukhopadyay, Binay K. Bhattacharya

Publication date: 31 August 1999

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

linear programminglinear-time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Computational complexity for the problem of optimal intersection of straight line segments by disks ⋮ Optimal Algorithms for Geometric Centers and Depth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• COMPUTING SHORTEST TRANSVERSALS OF SETS
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem

This page was built for publication: Optimal algorithms for some intersection radius problems