A sweepline algorithm to solve the two-center problem
From MaRDI portal
Publication:1318733
DOI10.1016/0020-0190(94)90007-8zbMath0799.68180OpenAlexW2161868952MaRDI QIDQ1318733
Ching-Ho Huang, Yue-Li Wang, Nen-Fu Huang
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
computational geometrysweepline algorithmaverage-case performancegeometric location problemtwo-center problem
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- On the Average Number of Maxima in a Set of Vectors and Applications
- Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. I
- [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]
- Unnamed Item
- Unnamed Item
- Unnamed Item