On the planar two-center problem and circular hulls

DOI10.1007/S00454-021-00358-5OpenAlexW4210438866MaRDI QIDQ2105328FDOQ2105328

Authors: Haitao Wang 

Publication date: 8 December 2022

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.07945

Recommendations

• scientific article; zbMATH DE number 7760197
• Topological analysis of the two-centre problem on the two-dimensional sphere
• scientific article; zbMATH DE number 2119682
• A Note on p-Center Problems in the Plane
• The 2-center problem in three dimensions
• The 2-center problem in three dimensions
• Geometric \(p\)-center problems with centers constrained to two lines
• On the planar piecewise quadratic 1-center problem
• The geodesic 2-center problem in a simple polygon
• On the 2-center problem under convex polyhedral distance function

zbMATH Keywords

dynamic data structurescircular hullsdisk coveragetwo centers

Mathematics Subject Classification ID

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

Cites Work

• A near-linear algorithm for the planar 2-center problem
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Title not available (Why is that?)
• Maintenance of configurations in the plane
• On the Complexity of Some Common Geometric Location Problems
• Slowing down sorting networks to obtain faster sorting algorithms
• Making data structures persistent
• Finding tailored partitions
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Time bounds for selection
• Bichromatic 2-center of pairs of points
• More planar two-center algorithms
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• On the shape of a set of points in the plane
• Title not available (Why is that?)
• A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions
• The discrete 2-center problem
• Title not available (Why is that?)
• An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
• The 2-center problem with obstacles
• An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
• Dynamic Three-Dimensional Linear Programming
• A faster algorithm for the two-center decision problem
• An Expander-Based Approach to Geometric Optimization
• Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
• Improved algorithms for the Bichromatic Two-Center problem for pairs of points

Cited In (7)

• Covering convex polygons by two congruent disks
• The two-center problem of uncertain points on trees
• The 2-mixed-center color spanning problem
• Efficient \(k\)-center algorithms for planar points in convex position
• Periodic solutions of the planar \(N\)-center problem with topological constraints
• Title not available (Why is that?)
• An optimal and practical algorithm for the planar 2-center problem

This page was built for publication: On the planar two-center problem and circular hulls

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