Computing half-plane and strip discrepancy of planar point sets
- 31 May 1996
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 6 (2) , 69-83
- https://doi.org/10.1016/0925-7721(95)00010-0
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Finding the upper envelope of n line segments in O(n log n) timeInformation Processing Letters, 1989
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- The rendering equationACM SIGGRAPH Computer Graphics, 1986
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- Stochastic sampling in computer graphicsACM Transactions on Graphics, 1986
- Antialiasing through stochastic samplingACM SIGGRAPH Computer Graphics, 1985
- Statistically optimized sampling for distributed ray tracingACM SIGGRAPH Computer Graphics, 1985
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Distributed ray tracingACM SIGGRAPH Computer Graphics, 1984
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979