A sweepline algorithm to solve the two-center problem

DOI10.1016/0020-0190(94)90007-8MaRDI QIDQ1318733zbMATH OpenOpenAlexFDO

Authors Nen-Fu Huang, Ching-Ho Huang, Yue-Li Wang

Publication date 5 April 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)90007-8

zbMATH Keywords

computational geometrysweepline algorithmaverage-case performancegeometric location problemtwo-center problem

Mathematics Subject Classification ID

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

Recommendations

• More planar two-center algorithms
• The discrete 2-center problem
• A faster algorithm for the two-center decision problem
• Efficient planar two-center algorithms
• A near-linear algorithm for the planar 2-center problem

Cites work

• scientific article; zbMATH DE number 432848 (Why is no real title available?)
• scientific article; zbMATH DE number 3172297 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• On the Average Number of Maxima in a Set of Vectors and Applications
• Sur L'enveloppe convexe des nuages de points aleatoires dans Rⁿ. I
• �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten

Cited in

(2)

• The two-line center problem from a polar view: a new algorithm and data structure
• A fast algorithm for the alpha-connected two-center decision problem

This page was built for publication: A sweepline algorithm to solve the two-center problem

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