COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET

DOI10.1142/S0218195999000091MaRDI QIDQ4513242zbMATH OpenFDO

Authors Alex Glozman, Klara Kedem, Gregory Shpitalnik

Publication date 7 November 2000

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

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

zbMATH Keywords

algorithmcenterHausdorff distanceoptimizationplanar point set

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Computing a Segment Center for a Planar Point Set
• A near-linear algorithm for the planar 2-center problem
• Efficient planar two-center algorithms
• The discrete 2-center problem
• More planar two-center algorithms

Cites work

• A near-linear algorithm for the planar 2-center problem
• An Expander-Based Approach to Geometric Optimization
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• Finding tailored partitions
• Finding the convex hull of a simple polygon
• Geometric complexity of some location problems
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• On a circle placement problem
• Optimal parallel algorithms for point-set and polygon problems

Cited in

(3)

• Continuous location of dimensional structures.
• On finding widest empty curved corridors
• Computing obnoxious 1-corner polygonal chains

This page was built for publication: COMPUTING A DOUBLE-RAY 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 Q4513242)