Computing a Segment Center for a Planar Point Set

DOI10.1006/jagm.1993.1043zbMath0785.68089OpenAlexW2029232964MaRDI QIDQ3141535

Sivan Toledo, Pankaj K. Agarwal, Alon Efrat, Micha Sharir

Publication date: 20 April 1994

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1043

zbMATH Keywords

parametric searchingcenter placement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications ⋮ Continuous location of dimensional structures. ⋮ Computing an obnoxious anchored segment. ⋮ Diameter, width, closest line pair, and parametric searching ⋮ A near-linear algorithm for the planar segment-center problem ⋮ Special issue on Locational analysis ⋮ Location of rectilinear center trajectories