Computing largest empty circles with location constraints
- 1 October 1983
- journal article
- Published by Springer Science and Business Media LLC in International Journal of Parallel Programming
- Vol. 12 (5), 347-358
- https://doi.org/10.1007/bf01008046
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- Detection is easier than computation (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1980
- A Note on Locating a Set of Points in a Planar SubdivisionSIAM Journal on Computing, 1979
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Closest-point problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975