Computing a Segment Center for a Planar Point Set

DOI10.1006/JAGM.1993.1043MaRDI QIDQ3141535zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1003238
• A near-linear algorithm for the planar 2-center problem
• A near-linear algorithm for the planar segment-center problem
• The discrete 2-center problem
• Computing a centerpoint of a finite planar set of points in linear time

Cited in

(11)

• Location of rectilinear center trajectories
• Special issue on Locational analysis
• Computing a centerpoint of a finite planar set of points in linear time
• Capturing the shape of a point set with a line segment
• Continuous location of dimensional structures.
• Computing an obnoxious anchored segment.
• A near-linear algorithm for the planar segment-center problem
• Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
• COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
• 1-Segment Center Problems
• Diameter, width, closest line pair, and parametric searching

This page was built for publication: Computing a Segment Center for a Planar Point Set

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