{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:43:19Z","timestamp":1649043799255},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Visual Computer"],"published-print":{"date-parts":[[1985,8]]},"DOI":"10.1007\/bf01898357","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T10:39:48Z","timestamp":1120559988000},"page":"133-150","source":"Crossref","is-referenced-by-count":6,"title":["Voronoi diagrams with barriers and on polyhedra for minimal path planning"],"prefix":"10.1007","volume":"1","author":[{"given":"W. Randolph","family":"Franklin","sequence":"first","affiliation":[]},{"given":"Varol","family":"Akman","sequence":"additional","affiliation":[]},{"given":"Colin","family":"Verrilli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01898357_CR1","unstructured":"(Anon) (1982) Statistical mechanics algorithm for Monte Carlo optimization. Physics Today: pp 17\u201319"},{"key":"BF01898357_CR2","volume-title":"Turtle geometry. The Computer as a medium for exploring mathematics","author":"H Abelson","year":"1982","unstructured":"Abelson H, DiSessa A (1982) Turtle geometry. The Computer as a medium for exploring mathematics. MIT Press, Cambridge, MA"},{"key":"BF01898357_CR3","unstructured":"Abramowitz M, Stern IA (1964) Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, pp 17\u201318"},{"key":"BF01898357_CR4","volume-title":"Findminpath algorithms for task-level (model-based) robot programming","author":"V Akman","year":"1984","unstructured":"Akman V (1984) Findminpath algorithms for task-level (model-based) robot programming. Manuscript, ECSE Dep., Rensselaer Polytechnic Inst., Troy, NY"},{"key":"BF01898357_CR5","volume-title":"Konvexe Polyeder (German, translated from Russian)","author":"AD Aleksandrov","year":"1958","unstructured":"Aleksandrov AD (1958) Konvexe Polyeder (German, translated from Russian). Akademie-Verlag, Berlin"},{"key":"BF01898357_CR6","volume-title":"Mathematics, its magic and mastery","author":"WW Bakst","year":"1941","unstructured":"Bakst WW (1941) Mathematics, its magic and mastery. D. Van Nostrand, New York"},{"key":"BF01898357_CR7","unstructured":"Bentley JL, Shamos MI (1976) Divide and conquer in multi-dimensional space. In Proceedings of the 8th ACM Annual Smyposium on Theory of Computing, pp 220\u2013230"},{"key":"BF01898357_CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TSMC.1983.6313112","volume":"13","author":"RA Brooks","year":"1983","unstructured":"Brooks RA (1983) Solving the Findpath problem by good representation of free space. IEEE Systems Man Cybernet 13:190\u2013197","journal-title":"IEEE Systems Man Cybernet"},{"key":"BF01898357_CR9","volume-title":"Geometric transforms for fast geometric algorithms","author":"KQ Brown","year":"1979","unstructured":"Brown KQ (1979) Geometric transforms for fast geometric algorithms, Ph.D. Thesis, also Dep. of Computer Science, Tech. Rep. CMU-CS-80-101, Carnegie-Mellon Univ., Pittsburgh, PA"},{"key":"BF01898357_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(79)90074-7","volume":"9","author":"KQ Brown","year":"1979","unstructured":"Brown KQ (1979) Voronoi diagrams from convex hulls. Information Processing Letters 9:223\u2013228","journal-title":"Information Processing Letters"},{"key":"BF01898357_CR11","volume-title":"Computational geometry and convexity","author":"BM Chazelle","year":"1980","unstructured":"Chazelle BM (1980) Computational geometry and convexity. Ph.D. Thesis, Computer Science Dep., Yale Univ., New Haven, CT, 1980. Also Tech. Rep. CMU-CS-80-150, Computer Science Dep., Carnegie-Mellon Univ., Pittsburgh, PA"},{"key":"BF01898357_CR12","volume-title":"Graph theory. An algorithmic approach","author":"N Christorides","year":"1975","unstructured":"Christorides N (1975) Graph theory. An algorithmic approach. Academic Press, New York"},{"key":"BF01898357_CR13","volume-title":"3.1416 and all that","author":"PJ Davis","year":"1966","unstructured":"Davis PJ, Chin WG (1966) 3.1416 and all that. Simon and Schuster, New York"},{"key":"BF01898357_CR14","unstructured":"Donald BR (1983) The Mover's problem in automated structural design. In: Proceedings of Harvard Computer Graphics Conference, Cambridge, MA"},{"key":"BF01898357_CR15","volume-title":"Generalized Voronoi diagrams and geometric searching","author":"RL Drysdale","year":"1975","unstructured":"Drysdale RL (1975) Generalized Voronoi diagrams and geometric searching, Ph.D. Thesis, also Computer Science Dep., Tech. Rep. STAN-CS-79-705, Stanford Univ., Stanford, CA"},{"key":"BF01898357_CR16","unstructured":"Efimov NV (1962) Qualitative problems of the theory of deformation of surfaces. In: Differential Geometry and Calculus of Variations (translated from Russian), AMS Translations Series 1, 6:274\u2013423"},{"key":"BF01898357_CR17","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"H Gindy El","year":"1981","unstructured":"El Gindy H, Avis D (1981) A linear algorithm for computing the visibility of a polygon from a point. J Algorithms 2:186\u2013197","journal-title":"J Algorithms"},{"key":"BF01898357_CR18","volume-title":"Fundamentals of Interactive Computer Graphics","author":"J Foley","year":"1982","unstructured":"Foley J, and Van Dam A (1982) Fundamentals of Interactive Computer Graphics. Addison-Wesley, Reading, MA"},{"key":"BF01898357_CR19","series-title":"Image Processing Lab, Tech. Rep.","volume-title":"Efficiently computing the haloed line effect for hidden line elimination","author":"WR Franklin","year":"1980","unstructured":"Franklin WR (1980) Efficiently computing the haloed line effect for hidden line elimination. Image Processing Lab, Tech. Rep. IPL-81-004, Rensselaer Polytechnic Inst., Troy, NY"},{"key":"BF01898357_CR20","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/S0146-664X(81)80017-2","volume":"15","author":"WR Franklin","year":"1981","unstructured":"Franklin WR (1981) An exact hidden sphere algorithm that operates in linear time. Comp Graph Image Processing 15:364\u2013379","journal-title":"Comp Graph Image Processing"},{"key":"BF01898357_CR21","volume-title":"Partitioning the plane to calculate minimal paths to any goal around obstructions","author":"WR Franklin","year":"1982","unstructured":"Franklin WR (1982) Partitioning the plane to calculate minimal paths to any goal around obstructions. Image Processing Lab, Tech. Rep., Rensselaer Polytechnic Inst., Troy, NY"},{"key":"BF01898357_CR22","unstructured":"Franklin WR, Akman V (1984) Minimal paths between source and goal points located on\/around a convex polyhedron. In: Proceedings of the 22nd Allerton Conference on Communication, Control, and Computing, Allerton IL"},{"key":"BF01898357_CR23","volume-title":"Euclidean shortest path in 3-space. Voronoi diagrams with barriers, and related complexity and algebraic issues (Extended abstract)","author":"WR Franklin","year":"1984","unstructured":"Franklin WR, Akman V (1984) Euclidean shortest path in 3-space. Voronoi diagrams with barriers, and related complexity and algebraic issues (Extended abstract). ECSE Dep., Tech. Rep., Rensselaer, Polytechnic Inst., Troy, NY"},{"key":"BF01898357_CR24","unstructured":"Frechet M, Fan K (1967) Initiation to Combinatorial Topology (translated from French). Prindle, Weber, and Schmidt, Complementary Series in Mathematics, Vol. 7, Boston, MA"},{"key":"BF01898357_CR25","volume-title":"Computers and intractability. A Guide to the theory of NP-Completeness","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS (1976) Computers and intractability. A Guide to the theory of NP-Completeness. WH Freeman, San Francisco, CA"},{"key":"BF01898357_CR26","doi-asserted-by":"crossref","unstructured":"Garey MR, Graham RI, Johnson DS (1976) Some NP-complete geometric problems. In: Proceedings of the 8th ACM Annual Symposium on Theory of Computing, pp 10\u201322","DOI":"10.1145\/800113.803626"},{"key":"BF01898357_CR27","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1109\/TIT.1983.1056738","volume":"29","author":"IG Gowda","year":"1983","unstructured":"Gowda IG, Kirkpatrick DG, Lee DT, Naamad A (1983) Dynamic Voronoi diagrams. IEEE Trans Inf Theory 29:724\u2013731","journal-title":"IEEE Trans Inf Theory"},{"key":"BF01898357_CR28","volume-title":"Convex Polytopes","author":"B Grunbaum","year":"1967","unstructured":"Grunbaum B (1967) Convex Polytopes, Wiley Interscience, New York"},{"key":"BF01898357_CR29","doi-asserted-by":"crossref","unstructured":"Guibas L, Stolfi J (1983) Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. In: Proceedings of the 15th ACM Annual Symposium on Theory of Computing, pp 221\u2013234","DOI":"10.1145\/800061.808751"},{"key":"BF01898357_CR30","doi-asserted-by":"crossref","unstructured":"Guibas L, Yao FF (1980) On translating a set of rectangles. In: Proceedings of the 10th ACM Annual Symposium on Theory of Computing, pp 154\u2013160","DOI":"10.1145\/800141.804663"},{"key":"BF01898357_CR31","volume-title":"On the complexity of motion planning for multiple independent objects:P-space hardness of the \u201cWarehouseman's Problem\u201d","author":"JE Hopcroft","year":"1984","unstructured":"Hopcroft JE, Schwartz JT, Sharir M (1984) On the complexity of motion planning for multiple independent objects:P-space hardness of the \u201cWarehouseman's Problem\u201d. Computer Science Div., Tech. Rep., Courant Inst. of Mathematical Sciences, New York Univ., New York"},{"key":"BF01898357_CR32","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","volume":"12","author":"N Katch","year":"1982","unstructured":"Katch N, Ibaraki T, Mine H (1982) An efficient algorithm fork shortest simple paths. Networks 12:411\u2013427","journal-title":"Networks"},{"key":"BF01898357_CR33","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick DG (1983) Optimal search in planar subdivisions. SIAM J Computing 12:28\u201335","journal-title":"SIAM J Computing"},{"key":"BF01898357_CR34","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0210006","volume":"10","author":"DT Lee","year":"1981","unstructured":"Lee DT, Drysdale RL (1981) Generalization of Voronoi diagrams in the plane SIAM J Computing 10:73\u201387","journal-title":"SIAM J Computing"},{"key":"BF01898357_CR35","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0206043","volume":"6","author":"DT Lee","year":"1977","unstructured":"Lee DT, Preparata FP (1977) Location of a point in a planar subdivision and its applications. SIAM J Computing 6:594\u2013606","journal-title":"SIAM J Computing"},{"key":"BF01898357_CR36","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee DT, Preparata FP (1984) Euclidean shortest paths in the presence of rectilinear barriers. Networks 14:393\u2013410","journal-title":"Networks"},{"key":"BF01898357_CR37","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0020-0190(79)90066-8","volume":"9","author":"DT Lee","year":"1979","unstructured":"Lee DT, Yang CC (1979) Location of multiple points in a planar subdivision. Information Processing Letters 9:190\u2013193","journal-title":"Information Processing Letters"},{"key":"BF01898357_CR38","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/360349.360355","volume":"19","author":"JZ Levin","year":"1976","unstructured":"Levin JZ (1976) A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces. Communications of the ACM 19:555\u2013563","journal-title":"Communications of the ACM"},{"key":"BF01898357_CR39","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0146-664X(79)90077-7","volume":"11","author":"JZ Levin","year":"1979","unstructured":"Levin JZ (1979) Mathematical models for determining the intersections of quadric surfaces. Comp Graph Image Processing 11:73\u201387","journal-title":"Comp Graph Image Processing"},{"key":"BF01898357_CR40","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0097-8493(80)90005-9","volume":"5","author":"JZ Levin","year":"1980","unstructured":"Levin JZ (1980) Implementation of two hidden-line algorithms. Comput Graph 5:31\u201340","journal-title":"Comput Graph"},{"key":"BF01898357_CR41","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton RJ, Tarjan RE (1979) A separator theorem, for planar graphs. SIAM J App Mathematics 36:177\u2013189","journal-title":"SIAM J App Mathematics"},{"key":"BF01898357_CR42","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton RJ, Tarjan RE (1980) Applications of a planar separator theorem. SIAM J Computing 9:615\u2013627","journal-title":"SIAM J Computing"},{"key":"BF01898357_CR43","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/TSMC.1981.4308589","volume":"11","author":"T Lozano-Perez","year":"1981","unstructured":"Lozano-Perez T (1981) Automatic planning of manipulator transfer movements. IEEE Systems Man Cybernet 11:681\u2013698","journal-title":"IEEE Systems Man Cybernet"},{"key":"BF01898357_CR44","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TC.1983.1676196","volume":"32","author":"T Lozano-Perez","year":"1983","unstructured":"Lozano-Perez T (1983) Spatial planning, a configuration space approach. IEEE Trans Computers 32:108\u2013120","journal-title":"IEEE Trans Computers"},{"key":"BF01898357_CR45","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T Lozano-Perez","year":"1979","unstructured":"Lozano-Perez T, Wesley MA (1979) An algorithm for planning collision-free paths among polyhedral objects. Communications of the ACM 22:560\u2013570","journal-title":"Communications of the ACM"},{"key":"BF01898357_CR46","volume-title":"Shortest Paths. Variational Problems","author":"LA Lyusternik","year":"1964","unstructured":"Lyusternik LA (1964) Shortest Paths. Variational Problems (translated from Russian). Macmillan Co., New York"},{"key":"BF01898357_CR47","series-title":"A.I. Memo","volume-title":"The Findpath, problem in the plane","author":"VD Nguyen","year":"1984","unstructured":"Nguyen VD (1984) The Findpath, problem in the plane. A.I. Memo No. 760, Artificial Intelligence Lab, Massachusetts Inst. of Technology, Cambridge, MA"},{"key":"BF01898357_CR48","volume-title":"The Voronoi method of motion planning I: the case of a disc","author":"C O'Dunlaing","year":"1983","unstructured":"O'Dunlaing C, Yap CK (1983) The Voronoi method of motion planning I: the case of a disc. Computer Science Div., Tech. Rep., Courant Inst. of Mathematical Sciences, New York Univ., New York"},{"key":"BF01898357_CR49","doi-asserted-by":"crossref","unstructured":"O'Rourke J, Suri S, Booth H (1985) Shortest paths on polyhedral surfaces. Proceedings of the 2nd Annual Symposium on Theoretical Aspects of Computer Science. Saarbr\u00fccken, W. Germany","DOI":"10.1007\/BFb0024013"},{"key":"BF01898357_CR50","volume-title":"Combinatorial Optimization. Algorithms and Complexity","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou CH, Steiglitz K (1982) Combinatorial Optimization. Algorithms and Complexity. Addison-Wesley, Reading, MA"},{"key":"BF01898357_CR51","doi-asserted-by":"crossref","volume-title":"Modeling, trajectory calculation, and servoing of a computer controlled arm","author":"RC Paul","year":"1972","unstructured":"Paul RC (1972) Modeling, trajectory calculation, and servoing of a computer controlled arm. Ph.D. Thesis, Dep. of Computer Science Stanford Univ., Stanford, CA","DOI":"10.21236\/AD0785071"},{"key":"BF01898357_CR52","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/MC.1979.1658812","volume":"12","author":"RC Paul","year":"1979","unstructured":"Paul RC (1979) Robots, models, and automation. IEEE Comput 12:19\u201327","journal-title":"IEEE Comput"},{"key":"BF01898357_CR53","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/359545.359557","volume":"21","author":"Y Perl","year":"1978","unstructured":"Perl Y, Itai A, Avni H (1978). Interpolation search \u2014 a log log N search. Communications of the ACM 21:550\u2013553","journal-title":"Communications of the ACM"},{"key":"BF01898357_CR54","unstructured":"Reif JH (1979) Complexity of the Mover's problem and generalizations (Extended abstract). In: Proceedings of 20th IEEE Annual Symposium on Foundations of Computer Science, pp 421\u2013427"},{"key":"BF01898357_CR55","series-title":"Computer Science Dep., Tech. Rep","volume-title":"Shortest paths in Euclidean, space with polyhedral obstacles","author":"JH Reif","year":"1985","unstructured":"Reif JH, Storer JA (1985) Shortest paths in Euclidean, space with polyhedral obstacles. Computer Science Dep., Tech. Rep. CS-85-121, Brandeis University, Waltham, MA"},{"key":"BF01898357_CR56","volume-title":"Optimization in Integers and Related Extremal Problems","author":"T Saaty","year":"1978","unstructured":"Saaty T (1978) Optimization in Integers and Related Extremal Problems, McGraw-Hill, New York"},{"key":"BF01898357_CR57","doi-asserted-by":"crossref","unstructured":"Saxe JB, Bentley JL (1979) Transforming static data structures to dynamic data structures. In: Proceedings of the 20th IEEE Annual Symposium on Foundations of Computer Science. pp 148\u2013168","DOI":"10.1109\/SFCS.1979.47"},{"key":"BF01898357_CR58","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/cpa.3160360305","volume":"XXXVI","author":"JT Schwartz","year":"1983","unstructured":"Schwartz JT, Sharir M (1983) On the \u201cPiano Movers\u201d problem: I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers. Communications on Pure and Applied Mathematics XXXVI:345\u2013398","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"BF01898357_CR59","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0196-8858(83)90014-3","volume":"4","author":"JT Schwartz","year":"1983","unstructured":"Schwartz JT, Sharir M (1983) On the \u201cPiano Movers\u201d problem: II. General techniques for computing topological properties of real algebraic manifolds. Adv Appl Mathematics 4:298\u2013351","journal-title":"Adv Appl Mathematics"},{"key":"BF01898357_CR60","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1177\/027836498300200304","volume":"2","author":"JT Schwartz","year":"1983","unstructured":"Schwartz JT, Sharir M (1983) On the \u201cPiano Movers\u201d problem: III. Coordinating the motion of several independent bodies: the special case of circular bodies moving amidst polygonal barriers. Int J Robotics Res 2:46\u201375","journal-title":"Int J Robotics Res"},{"key":"BF01898357_CR61","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/cpa.3160370406","volume":"XXXVII","author":"M Sharir","year":"1984","unstructured":"Sharir M, Ariel-Sheffi E (1984) On the \u201cPiano Movers\u201d problem: IV. Various decomposable two-dimensional motion-planning problems. Communications on Pure and Applied Mathematics XXXVII:479\u2013493","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"BF01898357_CR62","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1002\/cpa.3160370605","volume":"XXXVII","author":"JT Schwartz","year":"1984","unstructured":"Schwartz JT, Sharir M (1984) On the \u201cPiano Movers\u201d problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles. Communications on Pure and Applied Mathematics XXXVII:815\u2013848","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"BF01898357_CR63","volume-title":"Computational geometry","author":"MI Shamos","year":"1978","unstructured":"Shamos MI (1978) Computational geometry, Ph.D. Thesis, Dep. of Computer Science, Yale Univ., New Haven, CT"},{"key":"BF01898357_CR64","doi-asserted-by":"crossref","unstructured":"Shamos MI, Hoey D (1975) Closest-point problems. In Proceedings of 16th IEEE Annual Symposium on Foundations of Computer Science, pp 151\u2013162","DOI":"10.1109\/SFCS.1975.8"},{"key":"BF01898357_CR65","doi-asserted-by":"crossref","unstructured":"Sharir M, Schorr A (1984) On shortest paths in polyhedral spaces. In: Proceedings of the 16th ACM Annual Symposium on Theory of Computing, pp 144\u2013153","DOI":"10.1145\/800057.808676"},{"key":"BF01898357_CR66","volume-title":"Collision detection and avoidance in computer controlled manipulators","author":"SM Udupa","year":"1977","unstructured":"Udupa SM (1977) Collision detection and avoidance in computer controlled manipulators. Ph.D. Thesis. Dep. of Electrical Engineering, California Inst. of Technology, Pasadena, CA"},{"key":"BF01898357_CR67","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant LG (1979) The complexity of enumeration and reliability problems, SIAM J Computing 8:410\u2013421","journal-title":"SIAM J Computing"},{"key":"BF01898357_CR68","volume-title":"One source Voronoi diagrams with barriers, a computer implementation","author":"C Verrilli","year":"1984","unstructured":"Verrilli C (1984) One source Voronoi diagrams with barriers, a computer implementation. Image Processing Lab, Tech. Rep. IPL-TR-060. Rensselaer Polytechnic Inst., Troy, NY"},{"key":"BF01898357_CR69","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding thek shortest loopless paths in a network, Management Science 17:712\u2013716","journal-title":"Management Science"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01898357.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01898357\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01898357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T11:47:24Z","timestamp":1557488844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01898357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":69,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["BF01898357"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01898357","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":["Computer Graphics and Computer-Aided Design","Computer Vision and Pattern Recognition","Software"],"published":{"date-parts":[[1985,8]]}}}