Complexity, convexity, and unimodality
- 1 June 1984
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 13 (3) , 197-217
- https://doi.org/10.1007/bf00979872
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The symmetric all-furthest- neighbor problemComputers & Mathematics with Applications, 1983
- A Counterexample to a Diameter Algorithm for Convex PolygonsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- On the multimodality of distances in convex polygonsComputers & Mathematics with Applications, 1982
- Finding the Extrema of a RegionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- The relative neighbourhood graph of a finite planar setPattern Recognition, 1980
- On a general method for maximizing and minimizing among certain geometric problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- Decomposition of Polygons into Convex SetsIEEE Transactions on Computers, 1978
- Representation of figures by labeled graphsPattern Recognition, 1972
- Concavity Extraction by Parallel ProcessingIEEE Transactions on Systems, Man, and Cybernetics, 1971
- On The Different Distances Determined By n PointsThe American Mathematical Monthly, 1952