{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T15:32:12Z","timestamp":1673105532429},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1007\/bf01941684","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T10:32:20Z","timestamp":1122805940000},"page":"104-125","source":"Crossref","is-referenced-by-count":2,"title":["Parallel algorithms for arrangements"],"prefix":"10.1007","volume":"15","author":[{"given":"R.","family":"Anderson","sequence":"first","affiliation":[]},{"given":"P.","family":"Beanie","sequence":"additional","affiliation":[]},{"given":"E.","family":"Brisson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01941684_CR1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. K. Yap. Parallel computational geometry.Algorithmica, 3:293\u2013326, 1988.","journal-title":"Algorithmica"},{"key":"BF01941684_CR2","unstructured":"A. Aggarwal and J. Wein. Computational geometry: lecture notes for 18.409, spring 1988. Technical Report MIT\/LCS\/RSS 3, MIT Laboratory for Computer Science, 1988."},{"key":"BF01941684_CR3","doi-asserted-by":"crossref","unstructured":"R. J. Anderson, P. Beame, and E. Brisson. Parallel algorithms for arrangements.Proceedings of the Second Annual Symposium on Parallel Algorithms and Architectures, 1990, pp. 298\u2013306.","DOI":"10.1145\/97444.97697"},{"issue":"4","key":"BF01941684_CR4","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0213054","volume":"13","author":"D. Arnon","year":"1984","unstructured":"D. Arnon, G. Collins, and S. McCallum. Cylindrical algebraic decomposition,I andII. SIAM Journal on Computing, 13(4):865\u2013889, 1984.","journal-title":"I and II. SIAM Journal on Computing"},{"key":"BF01941684_CR5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0218035","volume":"18","author":"M. J. Atallah","year":"1989","unstructured":"M. J. Atallah, R. Cole, and M. T. Goodrich. Cascading divide-and-conquer: a technique for designing parallel algorithms.SIAM Journal on Computing, 18:499\u2013532, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"BF01941684_CR6","doi-asserted-by":"crossref","unstructured":"J. Canny. A new algebraic method for robot motion planning and real geometry.Proceedings of the 28th Symposium on Foundations of Computer Science, 1987, pp. 29\u201338.","DOI":"10.1109\/SFCS.1987.1"},{"key":"BF01941684_CR7","doi-asserted-by":"crossref","unstructured":"B. Chazelle. Intersecting is easier than sorting.Proceedings of the 16th ACM Symposium on Theory of Computation, 1984, pp. 125\u2013134.","DOI":"10.1145\/800057.808674"},{"key":"BF01941684_CR8","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B. Chazelle","year":"1985","unstructured":"B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality.BIT, 25:76\u201390, 1985.","journal-title":"BIT"},{"key":"BF01941684_CR9","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole and U. Vishkin. Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time.SIAM Journal on Computing, 17:128\u2013142, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"BF01941684_CR10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J. Driscoll","year":"1989","unstructured":"J. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan. Making data structures persistent.Journal of Computer and System Sciences, 38:86\u2013124, 1989.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF01941684_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner.Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987."},{"issue":"2","key":"BF01941684_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, J. O'Rourke, and R. Seidel. Constructing arrangements of lines and hyperplanes with applications.SIAM Journal on Computing, 15(2):341\u2013363, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"BF01941684_CR13","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich. Intersecting line segments in parallel with an output-sensitive number of processors.Proceedings of the First Annual Symposium on Parallel Algorithms and Architectures, 1989, pp. 127\u2013136.","DOI":"10.1145\/72935.72950"},{"key":"BF01941684_CR14","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich. Constructing arrangements optimal in parallel.Proceedings of the Third Annual Symposium on Parallel Algorithms and Architectures, 1991, pp. 169\u2013179. Also inDiscrete & Computational Geometry, 9:371\u2013385, 1993.","DOI":"10.1007\/BF02189329"},{"key":"BF01941684_CR15","doi-asserted-by":"crossref","unstructured":"T. Hagerup, H. Jung, and E. Welzl. Efficient parallel computation of arrangements of hyperplanes ind dimensions.Proceedings of the Second Annual Symposium on Parallel Algorithms and Architectures, 1990, pp. 290\u2013297.","DOI":"10.1145\/97444.97696"},{"key":"BF01941684_CR16","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J. J\u00e1J\u00e1.An Introduction to Parallel Algorithms. Addison-Wesley, Reading, MA, 1992."},{"issue":"1","key":"BF01941684_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/27625.27627","volume":"6","author":"M. McKenna","year":"1987","unstructured":"M. McKenna. Worst-case optimal hidden-surface removal.ACM Transactions on Graphics, 6(1): 19\u201328, 1987.","journal-title":"ACM Transactions on Graphics"},{"key":"BF01941684_CR18","doi-asserted-by":"crossref","unstructured":"J. H. Reif and S. Sen. Polling: a new randomized sampling technique for computational geometry.Proceedings of the 21st ACM Symposium on Theory of Computation, 1989, pp. 394\u2013404.","DOI":"10.1145\/73007.73045"},{"key":"BF01941684_CR19","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1951","unstructured":"A. Tarski.A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, CA, 1951."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941684.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01941684\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01941684","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T09:42:51Z","timestamp":1626255771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01941684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["BF01941684"],"URL":"https:\/\/doi.org\/10.1007\/bf01941684","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}