{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:41Z","timestamp":1759638881670},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":[[1993,2]]},"DOI":"10.1007\/bf01188708","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T17:39:58Z","timestamp":1108661998000},"page":"128-141","source":"Crossref","is-referenced-by-count":11,"title":["Constructing the Voronoi diagram of a set of line segments in parallel"],"prefix":"10.1007","volume":"9","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colm","family":"\ufffd'D\ufffdnlaing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chee K.","family":"Yap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"CR1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A. Agarwal","year":"1988","unstructured":"A. Agarwal, B. Chazelle, L. Guibas, C. \u00d3'D\u00fanlaing, and C. Yap, Parallel Computational Geometry,Algorithmica,3(3) (1988), 293?328.","journal-title":"Algorithmica"},{"issue":"3","key":"CR2","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 J. Comput.,18(3) (1989), 499?532.","journal-title":"SIAM J. Comput."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/BF01762130","volume":"4","author":"M. J. Atallah","year":"1988","unstructured":"M. J. Atallah and M. T. Goodrich, Parallel Algorithms for Some Functions of Two Convex Polygons,Algorithmica,4 (1988), 535?548.","journal-title":"Algorithmica"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0022-0000(84)90003-5","volume":"29","author":"M. J. Atallah","year":"1985","unstructured":"M. J. Atallah and U. Vishkin, Finding Euler Tours in Parallel,J. Comput. System Sci.,29 (1985), 330?337.","journal-title":"J. Comput. System Sci."},{"key":"CR5","first-page":"362","volume-title":"Proc. Symp. on Models for Perception of Speech and Visual Form","author":"H. Blum","year":"1967","unstructured":"H. Blum, A Transformation for Extracting New Descriptors of Shape,Proc. Symp. on Models for Perception of Speech and Visual Form (W. Whaten-Dunn, ed.), M.I.T. Press, Cambridge, MA, 1967, pp. 362?380."},{"issue":"4","key":"CR6","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole, Parallel Merge Sort,SIAM J. Comput.,17(4) (1988), 770?785.","journal-title":"SIAM J. Comput."},{"key":"CR7","unstructured":"R. Cole, M. T. Goodrich, and C. \u00d3'D\u00fanlaing, Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction,Proc. 17th Internat. Conf. on Automata, Languages, and Programming, 1990."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"S. Fortune, A Sweepline Algorithm for Voronoi Diagrams,Algorithmica,2 (1987), 153?174.","journal-title":"Algorithmica"},{"key":"CR9","unstructured":"R. M. Karp and V. Ramachandran, A Survey of Parallel Algorithms for Shared-Memory Machines, inHandbook of Theoretical Computer Science, North-Holland, Amsterdam, to appear."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick, Efficient Computation of Continuous Skeletons,Proc. 20th IEEE Symp. on Foundations of Computer Science, 1979, pp. 18?27.","DOI":"10.1109\/SFCS.1979.15"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"C. P. Kruskal, L. Rudolph, and M. Snir, The Power of Parallel Prefix,Proc. 1985 IEEE Internat. Conf. on Parallel Processing, 1985, pp. 180?185.","DOI":"10.1109\/TC.1985.6312202"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fischer, Parallel Prefix Computation,J. Assoc. Comput. Mach,27 (1980), 831?838.","journal-title":"J. Assoc. Comput. Mach"},{"issue":"4","key":"CR13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TPAMI.1982.4767267","volume":"4","author":"D. T. Lee","year":"1982","unstructured":"D. T. Lee, Medial Axis Transformation of a Planar Shape,IEEE Trans. Pattern Anal. Mach. Intell.,4(4) (1982), 363?369.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"CR14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0210006","volume":"10","author":"D. T. Lee","year":"1981","unstructured":"D. T. Lee and R. L. Drysdale, III, Generalization of Voronoi Diagrams in the Plane,SIAM J. Comput.,10(1) (1981), 73?87.","journal-title":"SIAM J. Comput."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"J. S. B. Mitchell, On Maximum Flows in Polyhedral Domains,Proc. 4th ACM Symp. on Comput. Geometry, 1988, pp. 341?351.","DOI":"10.1145\/73393.73428"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0196-6774(85)90021-5","volume":"6","author":"C. \u00d3'D\u00fanlaing","year":"1985","unstructured":"C. \u00d3'D\u00fanlaing and C. Yap, A ?Retraction? Method for Planning the Motion of a Disc,J. Algorithms,6 (1985), 104?111.","journal-title":"J. Algorithms"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"F. P. Preparata, The Medial Axis of a Simple Polygon,Proc. 6th Symp. on Mathematical Foundations of Computer Science, 1977, pp. 443?450.","DOI":"10.1007\/3-540-08353-7_166"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"M. I. Shamos, Geometric Complexity,Proc. 7th ACM Symp. on Theory of Computing, 1975, pp. 224?233.","DOI":"10.1145\/800116.803772"},{"key":"CR19","unstructured":"H. Wagener, Optimally Parallel Algorithms for Convex Hull Determination, unpublished manuscript, September 1985."},{"key":"CR20","unstructured":"J. C. Wyllie, The Complexity of Parallel Computation, Ph.D. thesis, Technical Report TR 79-387, Department of Computer Science, Cornell University, 1979."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","volume":"2","author":"C. K. Yap","year":"1987","unstructured":"C. K. Yap, AnO(n logn) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments,Discrete Comput. Geom.,2 (1987), 365?393.","journal-title":"Discrete Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188708.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01188708\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01188708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:41:47Z","timestamp":1556714507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01188708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF01188708"],"URL":"https:\/\/doi.org\/10.1007\/bf01188708","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}