{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:48Z","timestamp":1751282868458,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_247","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:12Z","timestamp":1330257912000},"page":"188-199","source":"Crossref","is-referenced-by-count":9,"title":["Parallel construction of quadtrees and quality triangulations"],"prefix":"10.1007","author":[{"given":"Marshall","family":"Bern","sequence":"first","affiliation":[]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","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 (1989) 499\u2013532.","journal-title":"SIAM J. Comput."},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02187904","volume":"3","author":"B. Baker","year":"1988","unstructured":"B. Baker, E. Grosse, and C. Rafferty. Nonobtuse triangulation of polygons. Discrete Comput. Geom. 3 (1988) 147\u2013168.","journal-title":"Discrete Comput. Geom."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"O. Berkman, D. Breslauer, Z. Galil, B. Schieber, and U. Vishkin. Highly parallelizable problems. 21st Symp. Theory of Computing (1989) 309\u2013319.","DOI":"10.1145\/73007.73036"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"M. Bern, D. Eppstein, and J.R. Gilbert. Provably good mesh generation. 31st Symp. Found. Comput. Sci. (1990) 231\u2013241. To appear in J. Comp. Sys. Sci.","DOI":"10.1109\/FSCS.1990.89542"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"M. Bern and D. Eppstein. Mesh generation and optimal triangulation. In Euclidean Geometry and the Computer, World Scientific, 1992.","DOI":"10.1142\/9789814355858_0002"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R.P. Brent","year":"1974","unstructured":"R.P. Brent. The parallel evaluation of general arithmetic expressions. J. ACM 21 (1974) 201\u2013206.","journal-title":"J. ACM"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"L.P. Chew. Guaranteed-quality triangular meshes. TR-89-983, Cornell, 1989.","DOI":"10.21236\/ADA210101"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole. Parallel merge sort. SIAM J. Comput. 17 (1988) 770\u2013785.","journal-title":"SIAM J. Comput."},{"key":"19_CR9","unstructured":"R. Cole and U. Vishkin. Optimal parallel algorithms for expression tree evaluation and list ranking. 3rd Aegean Workshop on Computing, Springer LNCS 319 (1988)."},{"key":"19_CR10","unstructured":"D. Eppstein. Approximating the minimum weight triangulation. 3rd Symp. Discrete Algorithms (1992) 48\u201357. To appear in Discrete Comput. Geom."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1146\/annurev.cs.03.060188.001313","volume":"3","author":"D. Eppstein","year":"1988","unstructured":"D. Eppstein and Z. Galil. Parallel algorithmic techniques for combinatorial computation. Ann. Rev. Comput. Sci. 3 (1988) 233\u2013283.","journal-title":"Ann. Rev. Comput. Sci."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"M.L. Fredman and D.E. Willard. Blasting through the information-theoretic barrier with fusion trees. 22nd Symp. Theory of Computing (1990) 1\u20137.","DOI":"10.1145\/100216.100217"},{"key":"19_CR13","unstructured":"E.A. Melissaratos and D.L. Souvaine. Coping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes. 8th Symp. Comput. Geom. (1992) 202\u2013211."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"S.A. Mitchell and S.A. Vavasis. Quality mesh generation in three dimensions. 8th Symp. Comput. Geom. (1992) 212\u2013221.","DOI":"10.1145\/142675.142720"},{"key":"19_CR15","unstructured":"J. Ruppert. A new and simple algorithm for quality 2-dimensional mesh generation. 4th Symp. Discrete Algorithms (1993) 83\u201392."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"H. Samet. The quadtree and related hierarchical data structures. Computing Surveys 16 (1984) 188\u2013260.","journal-title":"Computing Surveys"},{"key":"19_CR17","unstructured":"D.E. Willard. Applications of the fusion tree method to computational geometry and searching. 3rd Symp. Discrete Algorithms (1992) 286\u2013295."},{"key":"19_CR18","unstructured":"R.D. Williams. Adaptive parallel meshes with complex geometry. Tech. Report CRPC-91-2, Center for Research on Parallel Computation, Cal. Tech."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_247.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:00:09Z","timestamp":1742594409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_247","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}