Computing largest empty circles with location constraints
Author:
- 1 October 1983
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 12 (5) , 347-358
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On Geometric Algorithms that use the Furthest-Point Voronoi Diagram* *Research supported by N.S.E.R.C. grant No. A-2422 and A-9293.1985
- 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)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 problems1975