Some dynamic computational geometry problems
- 1 December 1985
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 11 (12), 1171-1181
- https://doi.org/10.1016/0898-1221(85)90105-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A Lower Bound to Finding Convex HullsJournal of the ACM, 1981
- On the Ω(n log n) lower bound for convex hull and maximal vector determinationInformation Processing Letters, 1980
- On the complexity of computations under varying sets of primitivesJournal of Computer and System Sciences, 1979
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- On Finding the Maxima of a Set of VectorsJournal of the ACM, 1975
- On a problem of Davenport and SchinzelActa Arithmetica, 1973
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972
- A combinatorial problem connected with differential equations IIActa Arithmetica, 1970
- A Combinatorial Problem Connected with Differential EquationsAmerican Journal of Mathematics, 1965