{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:57Z","timestamp":1725663297383},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528463"},{"type":"electronic","value":"9783540471646"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52846-6_78","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:44:21Z","timestamp":1330206261000},"page":"60-70","source":"Crossref","is-referenced-by-count":1,"title":["Translating polygons with applications to hidden surface removal"],"prefix":"10.1007","author":[{"given":"Mark","family":"Berg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Chazelle, B., A Theorem on Polygon Cutting with Applications, Proc. 23rd Annual IEEE Symp. on Foundations of Computer Science, 1982, pp. 339\u2013349.","DOI":"10.1109\/SFCS.1982.58"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Dehne, F., and J.-R. Sack, Separability of Sets of Polygons, Proc. 12th International Workshop on Graph-Theoretic Concepts in Computer Science, 1986, pp. 237\u2013251.","DOI":"10.1007\/3-540-17218-1_62"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01901191","volume":"3","author":"P. Egyed","year":"1988","unstructured":"Egyed, P., Hidden Surface Removal in Polyhedral-Cross-Sections, The Visual Computer 3 (1988), pp. 329\u2013343.","journal-title":"The Visual Computer"},{"key":"6_CR4","unstructured":"El Gindy, H.A., and G.T. Toussaint, Efficient Algorithms for Inserting and Deleting Edges from Triangulations, Proc. International Conf. on Foundations of Data Organization, 1985."},{"key":"6_CR5","unstructured":"Guibas, L.J., and F.F. Yao, On Translating a Set of Rectangles, in: F. P. Preparata (Ed.), Advances in Computing Research Vol. I: Computational Geometry, JAI Press Inc., 1983, pp. 61\u201377."},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0604020","volume":"14","author":"J. Kahn","year":"1983","unstructured":"Kahn, J., M. Klawe and D. Kleitman, Traditional Galleries Require Fewer Watchmen, SIAM J. Alg. Disc. Meth. 14 (1983), pp. 194\u2013206.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"6_CR7","volume-title":"Fundamental Algorithms: The Art of Computer Programming I","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E., Fundamental Algorithms: The Art of Computer Programming I, Addison-Wesley, Reading, Mass., 1968."},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D.T. Lee","year":"1984","unstructured":"Lee, D.T., and F.P. Preparata, Euclidean Shortest Paths in the Presence of Rectilinear Barriers, Networks 14 (1984), pp. 393\u2013410.","journal-title":"Networks"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0734-189X(86)80028-7","volume":"36","author":"O. Nurmi","year":"1986","unstructured":"Nurmi, O., On Translating a Set of Objects in Two-and Three-dimensional Space, Computer Vision, Graphics and Image Processing 36 (1986), pp. 42\u201352.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"6_CR10","unstructured":"Nussbaum, D., and J.-R. Sack, Translation Separability of Polyhedra, manuscript, presented at the 1st Canadian Conf. on Computational Geometry."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Nussbaum, D., and J.-R. Sack, Disassembling Two-dimensional Composite Parts Via Translations, Proc. Int. Conf. on Optimal Algorithms, 1989.","DOI":"10.1007\/3-540-51859-2_14"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Paterson, M.S., and F.F. Yao, Binary Partitions with Applications to Hidden-Surface Removal and Solid Modelling, Proc. 5th Annual ACM Symp. on Computational Geometry, 1989, pp. 23\u201332.","DOI":"10.1145\/73833.73836"},{"key":"6_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry, an introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., and M.I. Shamos, Computational geometry, an introduction, Springer-Verlag, New York, 1985."},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(81)90091-0","volume":"12","author":"F.P. Preparata","year":"1981","unstructured":"Preparata, F.P., and K.J. Supowit, Testing a Simple Polygon for Monotonicity, Inform. Proc. Letters 12 (1981), pp.161\u2013164.","journal-title":"Inform. Proc. Letters"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Reif, J.H., and S. Sen, An Efficient Output-Sensitive Hidden-Surface Removal Algorithm and its Parallelization, Proc. 4th Annual ACM Symp. on Computational Geometry, 1988, pp. 193\u2013200.","DOI":"10.1145\/73393.73413"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0734-189X(83)90062-2","volume":"24","author":"T. Ottman","year":"1983","unstructured":"Ottman, T., and P. Widmayer, On Translating a Set of Line Segments, Computer Vision, Graphics and Image Processing 24 (1983), pp. 382\u2013389.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Sack, J.-R., and G.T. Toussaint, Translating Polygons in the Plane, Proc. 2nd Annual Symp. on Theoretical Aspects of Computer Science, 1985, pp. 310\u2013321.","DOI":"10.1007\/BFb0024019"},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","volume":"17","author":"R.E. Tarjan","year":"1988","unstructured":"Tarjan, R.E., and C.J. van Wyk, An O(n log log n) Time Algorithm for Triangulating Simple Polygons, SIAM J. Comput. 17 (1988), pp. 143\u2013178.","journal-title":"SIAM J. Comput."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Toussaint, G.T., Movable Separability of Sets, in: G.T. Toussaint (Ed.), Computational Geometry, North Holland, 1985, pp. 335\u2013376.","DOI":"10.1016\/B978-0-444-87806-9.50018-9"},{"key":"6_CR20","unstructured":"Toussaint, G.T., On Separating Two Simple Polygons by a Single Translation, Techn. Rep. SOCS-88.8, McGill University, 1988."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Yao, F.F., On the Priority Approach to Hidden-Surface Algorithms, Proc. 21st Annual IEEE Symp. on Foundations of Computer Science, 1980, pp. 301\u2013307.","DOI":"10.1109\/SFCS.1980.32"}],"container-title":["Lecture Notes in Computer Science","SWAT 90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52846-6_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:20Z","timestamp":1605648320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52846-6_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528463","9783540471646"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-52846-6_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}