COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
From MaRDI portal
Publication:4513242
DOI10.1142/S0218195999000091zbMath1020.52012MaRDI QIDQ4513242
Gregory Shpitalnik, Alex Glozman, Klara Kedem
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (3)
On finding widest empty curved corridors ⋮ Continuous location of dimensional structures. ⋮ Computing obnoxious 1-corner polygonal chains
Cites Work
- On a circle placement problem
- Geometric complexity of some location problems
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Optimal parallel algorithms for point-set and polygon problems
- A near-linear algorithm for the planar 2-center problem
- Finding tailored partitions
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- An Expander-Based Approach to Geometric Optimization
- Finding the convex hull of a simple polygon
This page was built for publication: COMPUTING A DOUBLE-RAY CENTER FOR A PLANAR POINT SET
