{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:33Z","timestamp":1725664533050},"publisher-location":"Berlin, Heidelberg","reference-count":69,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:20Z","timestamp":1330278740000},"page":"109-121","source":"Crossref","is-referenced-by-count":3,"title":["Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications"],"prefix":"10.1007","author":[{"given":"Micha","family":"Sharir","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, B. Aronov and M. Sharir, Computing envelopes in four dimensions with applications, Proc. 10th ACM Symp. on Computational Geometry (1994), 348\u2013358.","DOI":"10.1145\/177424.178081"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/BF01187037","volume":"9","author":"P.K. Agarwal","year":"1993","unstructured":"P.K. Agarwal, B. Aronov, M. Sharir and S. Suri, Selecting distances in the plane, Algorithmica 9 (1993), 495\u2013514.","journal-title":"Algorithmica"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, A. Efrat and M. Sharir, Vertical decompositions of shallow levels in arrangements and their applications, Proc. 11th ACM Symp. on Computational Geometry (1995).","DOI":"10.1145\/220279.220284"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1006\/jagm.1993.1043","volume":"15","author":"P.K. Agarwal","year":"1993","unstructured":"P.K. Agarwal, A. Efrat, M. Sharir and S. Toledo, Computing a segment-center for a planar point set, J. Algorithms 15 (1993), 314\u2013323.","journal-title":"J. Algorithms"},{"key":"10_CR5","unstructured":"P.K. Agarwal, O. Schwarzkopf and M. Sharir, The overlay of lower envelopes in 3-space and its applications, to appear in Discrete Comput. Geom."},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02574373","volume":"12","author":"P.K. Agarwal","year":"1994","unstructured":"P.K. Agarwal and M. Sharir, On the number of views of polyhedral terrains, Discrete Comput. Geom. 12 (1994), 177\u2013182.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal and M. Sharir, Efficient randomized algorithms for some geometric optimization problems, Proc. 11th ACM Symp. on Computational Geometry, 1995.","DOI":"10.1145\/220279.220314"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0097-3165(89)90032-0","volume":"52","author":"P. Agarwal","year":"1989","unstructured":"P. Agarwal, M. Sharir and P. Shor, Sharp upper and lower bounds for the length of general Davenport Schinzel sequences, J. Combin. Theory, Ser. A 52 (1989), 228\u2013274.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1006\/jagm.1994.1038","volume":"17","author":"P.K. Agarwal","year":"1994","unstructured":"P.K. Agarwal, M. Sharir and S. Toledo, New applications of parametric searching in computational geometry. J. Algorithms 17 (1994), 292\u2013318.","journal-title":"J. Algorithms"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02189317","volume":"9","author":"B. Aronov","year":"1993","unstructured":"B. Aronov, M. Pellegrini and M. Sharir, On the zone of a surface in a hyperplane arrangement, Discrete Comput. Geom. 9 (1993), 177\u2013186.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR11","unstructured":"B. Aronov, personal communication, 1995."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"B. Aronov and M. Sharir, The union of convex polyhedra in three dimensions, Proc. 34th IEEE Symp. on Foundations of Computer Science (1993), 518\u2013527.","DOI":"10.1109\/SFCS.1993.366835"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/BF02574371","volume":"12","author":"B. Aronov","year":"1994","unstructured":"B. Aronov and M. Sharir, Castles in the air revisited, Discrete Comput. Geom. 12 (1994), 119\u2013150.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"B. Aronov and M. Sharir, On translational motion planning in three dimensions, Proc. 10th ACM Symp. on Computationl Geometry (1994), 21\u201330.","DOI":"10.1145\/177424.177445"},{"key":"10_CR15","unstructured":"B. Aronov, M. Sharir and B. Tagansky, The union of convex polyhedra in three dimensions, to appear in SIAM J. Comput. (a revised version of [12])."},{"key":"10_CR16","unstructured":"J.D. Boissonnat and K. Dobrindt, Randomized construction of the upper envelope of triangles in \u211d3, Proc. 4th Canadian Conf. on Computational Geometry (1992), 311\u2013315."},{"key":"10_CR17","unstructured":"J.D. Boissonnat and K. Dobrindt, On-line randomized construction of the upper envelope of triangles and surface patches in \u211d3, to appear in Comp. Geom. Theory Appls."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"J.D. Boissonnat, M. Sharir, B. Tagansky and M. Yvinec, Voronoi diagrams in higher dimensions under certain polyhedral convex distance functions, Proc. 11th ACM Symp. on Computational Geometry (1995).","DOI":"10.1145\/220279.220288"},{"key":"10_CR19","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/ima.1850020407","volume":"2","author":"K.W. Bowyer","year":"1990","unstructured":"K.W. Bowyer and C.R. Dyer, Aspect graphs: An introduction and survey of recent results, Int. J. of Imaging Systems and Technology 2 (1990), 315\u2013328.","journal-title":"Int. J. of Imaging Systems and Technology"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Proc. 16th Int. Colloq. on Automata, Languages and Programming (1989), 179\u2013193.","DOI":"10.1007\/BFb0035760"},{"key":"10_CR21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02573973","volume":"10","author":"B. Chazelle","year":"1993","unstructured":"B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, Diameter, width, closest line pair, and parametric searching, Discrete Comput. Geom. 10 (1993), 183\u2013196.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR22","unstructured":"L.P. Chew, Near-quadratic bounds for the L 1 Voronoi diagram of moving points, Proc. 5th Canadian Conf. on Computational Geometry (1993), 364\u2013369."},{"key":"10_CR23","unstructured":"L.P. Chew, K. Kedem, M. Sharir, B. Tagansky and E. Welzl, Voronoi diagrams of lines in three dimensions under a polyhedral convex distance function, Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (1995), 197\u2013204."},{"key":"10_CR24","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02187879","volume":"2","author":"K.L. Clarkson","year":"1987","unstructured":"K.L. Clarkson, New applications of random sampling in computational geometry, Discrete Comput. Geom. 2 (1987), 195\u2013222.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR25","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"K.L. Clarkson and P.W. Shor, Applications of random sampling in computational geometry, II, Discrete Comput. Geom. 4 (1989), 387\u2013421.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR26","unstructured":"M. de Berg, personal communication, 1993."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"M. de Berg, K. Dobrindt and O. Schwarzkopf, On lazy randomized incremental construction, Proc. 26th. ACM Symp. on Theory of Computing (1994), 105\u2013114.","DOI":"10.1145\/195058.195113"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"M. de Berg, L. Guibas and D. Halperin, Vertical decomposition for triangles in 3-space, Proc. 10th ACM Symp. on Computational Geometry (1994), 1\u201310.","DOI":"10.1145\/177424.177427"},{"key":"10_CR29","unstructured":"M. de Berg, D. Halperin, M. Overmars and M. van Kreveld, Sparse arrangements and the number of views of polyhedral scenes, Manuscript, 1991."},{"key":"10_CR30","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, Heidelberg 1987."},{"key":"10_CR31","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02187734","volume":"4","author":"H. Edelsbrunner","year":"1989","unstructured":"H. Edelsbrunner, The upper envelope of piecewise linear functions: Tight complexity bounds in higher dimensions, Discrete Comput. Geom. 4 (1989), 337\u2013343.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0304-3975(92)90319-B","volume":"92","author":"H. Edelsbrunner","year":"1992","unstructured":"H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel and M. Sharir, Arrangements of curves in the plane: topology, combinatorics, and algorithms, Theoret. Comput. Sci. 92 (1992), 319\u2013336.","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR33","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02187681","volume":"1","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner and R. Seidel, Voronoi diagrams and arrangements, Discrete Comput. Geom. 1 (1986), 25\u201344.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0222031","volume":"22","author":"H. Edelsbrunner","year":"1993","unstructured":"H. Edelsbrunner, R. Seidel and M. Sharir, On the zone theorem for hyperplane arrangements, SIAM J. Comput. 22 (1993), 418\u2013429.","journal-title":"SIAM J. Comput."},{"key":"10_CR35","unstructured":"A. Efrat and M. Sharir, A near-linear algorithm for the planar segment center problem, to appear in Discrete Comput. Geom."},{"key":"10_CR36","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1142\/S0218195991000037","volume":"1","author":"J.-J. Fu","year":"1994","unstructured":"J.-J. Fu and R.C.T. Lee, Voronoi diagrams of moving points in the plane, Internat. J. Comput. Geom. Appl. 1 (1994), 23\u201332.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10_CR37","doi-asserted-by":"crossref","unstructured":"L. Guibas, D. Halperin, J. Matou\u0161ek and M. Sharir, On vertical decomposition of arrangements of hyperplanes in four dimensions, Discrete Comput. Geom. 14 (1995) (in press).","DOI":"10.1007\/BF02570698"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"L. Guibas, J. Mitchell and T. Roos, Voronoi diagrams of moving points in the plane, Proc. 17th Internat. Workshop Graph-Theoret. Concepts Computer Science, Lecture Notes in Comp. Sci., vol. 570, Springer-Verlag, pp. 113\u2013125.","DOI":"10.1007\/3-540-55121-2_11"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"L. Guibas and M. Sharir, Combinatorics and algorithms of arrangements, in New Trends in Discrete and Computational Geometry, (J. Pach, Ed.), Springer-Verlag, 1993, 9\u201336.","DOI":"10.1007\/978-3-642-58043-7_2"},{"key":"10_CR40","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/BF02187744","volume":"4","author":"L. Guibas","year":"1989","unstructured":"L. Guibas, M. Sharir and S. Sifrony, On the general motion planning problem with two degrees of freedom, Discrete Comput. Geom. 4 (1989), 491\u2013521.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02573992","volume":"11","author":"D. Halperin","year":"1994","unstructured":"D. Halperin, On the complexity of a single cell in certain arrangements of surfaces in 3-space, Discrete Comput. Geom. 11 (1994), 1\u201333.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"D. Halperin and M. Sharir, Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment, Proc. 34th IEEE Symp. on Foundations of Computer Science (1993), 382\u2013391.","DOI":"10.1109\/SFCS.1993.366849"},{"key":"10_CR43","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF02574383","volume":"12","author":"D. Halperin","year":"1994","unstructured":"D. Halperin and M. Sharir, New bounds for lower envelopes in three dimensions with applications to visibility of terrains, Discrete Comput. Geom. 12 (1994), 313\u2013326.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"D. Halperin and M. Sharir, Almost tight upper bounds for the single cell and zone problems in three dimensions, Proc. 10th ACM Symp. on Computational Geometry (1994), 11\u201320.","DOI":"10.1145\/177424.177436"},{"key":"10_CR45","first-page":"495","volume-title":"The Algorithmic Foundations of Robotics","author":"D. Halperin","year":"1995","unstructured":"D. Halperin and M. Sharir, Arrangements and their applications in robotics: Recent developments, in The Algorithmic Foundations of Robotics, K. Goldberg, D. Halperin, J.C. Latombe and R. Wilson, Eds., A.K. Peters, Boston, MA, 1995, 495\u2013511."},{"key":"10_CR46","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","volume":"6","author":"S. Hart","year":"1986","unstructured":"S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6 (1986), 151\u2013177.","journal-title":"Combinatorica"},{"key":"10_CR47","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"D. Haussler and E. Welzl, \u03b5-nets and simplex range queries, Discrete Comput. Geom. 2 (1987), 127\u2013151.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"J. Heintz, T. Recio and M.F. Roy, Algorithms in real algebraic geometry and applications to computational geometry, in Discrete and Computational Geometry: Papers from DIMACS Special Year, (J. Goodman, R. Pollack, and W. Steiger, Eds.), American Mathematical Society, Providence, RI, 137\u2013163.","DOI":"10.1090\/dimacs\/006\/08"},{"key":"10_CR49","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(93)90234-Z","volume":"47","author":"M. Katz","year":"1993","unstructured":"M. Katz and M. Sharir, Optimal slope selection via expanders, Inform. Process. Lett. 47 (1993), 115\u2013122.","journal-title":"Inform. Process. Lett."},{"key":"10_CR50","doi-asserted-by":"crossref","unstructured":"M. Katz and M. Sharir, An expander-based approach to geometric optimization, Proc. 9th ACM Symp. cm Computational Geometry (1993), 198\u2013207.","DOI":"10.1145\/160985.161137"},{"key":"10_CR51","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02187779","volume":"5","author":"K. Kedem","year":"1990","unstructured":"K. Kedem and M. Sharir, An efficient motion planning algorithm for a convex rigid polygonal object in 2-dimensional polygonal space, Discrete Comput. Geom. 5 (1990), 43\u201375.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR52","unstructured":"K. Kedem, M. Sharir and S. Toledo, On critical orientations in the Kedem-Sharir motion planning algorithm for a convex polygon in the plane, Proc. 5th Canadian Conference on Computational Geometry (1993), 204\u2013209."},{"key":"10_CR53","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02187833","volume":"7","author":"J. Koml\u00f3s","year":"1992","unstructured":"J. Koml\u00f3s, J. Pach and G. Woeginger, Almost tight bound on epsilon-nets, Discrete and Computational Geometry 7 (1992), 163\u2013173.","journal-title":"Discrete and Computational Geometry"},{"key":"10_CR54","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek, Approximations and optimal geometric divide-and-conquer, Proc. 23rd ACM Symp. on Theory of Computing (1991), 506\u2013511.","DOI":"10.1145\/103418.103470"},{"key":"10_CR55","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(91)90177-J","volume":"39","author":"J. Matou\u0161ek","year":"1991","unstructured":"J. Matou\u0161ek, Randomized optimal algorithm for slope selection, Inform. Process. Lett 39 (1991), 183\u2013187.","journal-title":"Inform. Process. Lett"},{"key":"10_CR56","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1137\/S009753979018330X","volume":"23","author":"J. Matou\u0161ek","year":"1994","unstructured":"J. Matou\u0161ek, J. Pach, M. Sharir, S. Sifrony and E. Welzl, Fat triangles determine linearly many holes, SIAM J. Comput. 23 (1994), 154\u2013169.","journal-title":"SIAM J. Comput."},{"key":"10_CR57","series-title":"Lecture Notes Ser. 3","volume-title":"Convex Polytopes and the Upper Bound Conjecture","author":"P. McMullen","year":"1971","unstructured":"P. McMullen and G. C. Shephard, Convex Polytopes and the Upper Bound Conjecture, Lecture Notes Ser. 3, Cambridge University Press, Cambridge, England, 1971."},{"key":"10_CR58","doi-asserted-by":"crossref","unstructured":"N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. ACM 30, 852\u2013865.","DOI":"10.1145\/2157.322410"},{"key":"10_CR59","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02187732","volume":"4","author":"J. Pach","year":"1989","unstructured":"J. Pach and M. Sharir, The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis, Discrete Comput. Geom. 4 (1989), 291\u2013309.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR60","doi-asserted-by":"crossref","unstructured":"M. Pellegrini, On lines missing polyhedral sets in 3-space, Proc. 9th ACM Symp. on Computational Geometry (1993), 19\u201328.","DOI":"10.1145\/160985.160990"},{"key":"10_CR61","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF00054919","volume":"5","author":"H. Plantinga","year":"1990","unstructured":"H. Plantinga and C. Dyer, Visibility, occlusion, and the aspect graph, International J. Computer Vision, 5 (1990), 137\u2013160.","journal-title":"International J. Computer Vision"},{"key":"10_CR62","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/0196-8858(83)90014-3","volume":"4","author":"J.T. Schwartz","year":"1983","unstructured":"J.T. Schwartz and M. Sharir, On the Piano Movers' problem: II. General techniques for computing topological properties of real algebraic manifolds, Advances in Appl. Math. 4 (1983), 298\u2013351.","journal-title":"Advances in Appl. Math."},{"key":"10_CR63","unstructured":"O. Schwarzkopf and M. Sharir, Vertical decomposition of a single cell in 3-dimensional arrangements and its applications, in preparation."},{"key":"10_CR64","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02574384","volume":"12","author":"M. Sharir","year":"1994","unstructured":"M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12 (1994), 327\u2013345.","journal-title":"Discrete Comput. Geom."},{"key":"10_CR65","volume-title":"Davenport-Schinzel Sequences and Their Geometric Applications","author":"M. Sharir","year":"1995","unstructured":"M. Sharir and P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995."},{"key":"10_CR66","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0925-7721(94)90011-6","volume":"4","author":"M. Sharir","year":"1994","unstructured":"M. Sharir and S. Toledo, Extremal polygon containment problems, Comput. Geom. Theory Appls. 4 (1994), 99\u2013118.","journal-title":"Comput. Geom. Theory Appls."},{"key":"10_CR67","doi-asserted-by":"crossref","unstructured":"B. Tagansky, A new technique for analyzing substructures in arrangements, Proc. 11th ACM Symp. on Computational Geometry (1995).","DOI":"10.1145\/220279.220301"},{"key":"10_CR68","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/0218080","volume":"18","author":"P.M. Vaidya","year":"1989","unstructured":"P.M. Vaidya, Geometry helps in matching, SIAM J. Comput. 18 (1989), 1201\u20131225.","journal-title":"SIAM J. Comput."},{"key":"10_CR69","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02187894","volume":"3","author":"A. Wiernik","year":"1988","unstructured":"A. Wiernik and M. Sharir, Planar realization of nonlinear Davenport-Schinzel sequences by segments, Discrete Comput. Geom. 3 (1988), 15\u201347.","journal-title":"Discrete Comput. Geom."}],"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-60220-8_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:31:38Z","timestamp":1640943098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}