{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:50:46Z","timestamp":1648921846469},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1007\/bf01582886","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:11Z","timestamp":1114677311000},"page":"179-190","source":"Crossref","is-referenced-by-count":0,"title":["Using Gale transforms in computational geometry"],"prefix":"10.1007","volume":"52","author":[{"given":"Franz","family":"Aurenhammer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"T. Asano, T. Asano, L. Guibas, J. Hershberger and H. Imai, \u201cVisibility of disjoint polygons,\u201dAlgorithmica 1 (1986) 49\u201363.","journal-title":"Algorithmica"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0747-7171(87)80003-2","volume":"3","author":"F. Aurenhammer","year":"1987","unstructured":"F. Aurenhammer, \u201cRecognising polytopical cell complexes and constructing projection polyhedra,\u201dJournal of Symbolic Computation 3 (1987) 249\u2013255.","journal-title":"Journal of Symbolic Computation"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"F. Aurenhammer, \u201cA relationship between Gale transforms and Voronoi diagrams,\u201dDiscrete Applied Mathematics, to appear.","DOI":"10.1016\/0166-218X(90)90108-O"},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1148-8","volume-title":"An Introduction to Convex Polytopes","author":"A. Brondsted","year":"1983","unstructured":"A. Brondsted,An Introduction to Convex Polytopes (Springer, New York\u2014Heidelberg\u2014Berlin, 1983)."},{"key":"CR5","volume-title":"Geometric Transforms for Fast Geometric Algorithms","author":"K.Q. Brown","year":"1980","unstructured":"K.Q. Brown,Geometric Transforms for Fast Geometric Algorithms (Springer, Berlin\u2014Heidelberg, 1980)."},{"key":"CR6","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, Berlin\u2014Heidelberg, 1987)."},{"key":"CR7","first-page":"225","volume-title":"Linear Inequalities and Related Systems","author":"D. Gale","year":"1956","unstructured":"D. Gale, \u201cNeighboring vertices on a convex polyhedron,\u201d in: H.W. Kuhn and A.W. Tucker, eds.,Linear Inequalities and Related Systems (Princeton University Press, Princeton, NJ, 1956) pp. 225\u2013263."},{"key":"CR8","volume-title":"Convex Polytopes","author":"B. Gruenbaum","year":"1967","unstructured":"B. Gruenbaum,Convex Polytopes (Interscience, New York, 1967)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(85)90060-5","volume":"10","author":"H. Imai","year":"1985","unstructured":"H. Imai, \u201cOn combinatorial structures of line drawings of polyhedra,\u201dDiscrete Applied Mathematics 10 (1985) 79\u201392.","journal-title":"Discrete Applied Mathematics"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(84)90090-8","volume":"9","author":"D. Marcus","year":"1984","unstructured":"D. Marcus, \u201cGale diagrams of convex polytopes and positive spanning sets of vectors,\u201dDiscrete Applied Mathematics 9 (1984) 47\u201367.","journal-title":"Discrete Applied Mathematics"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"T.H. Mattheiss","year":"1980","unstructured":"T.H. Mattheiss and D.S. Rubin, \u201cA survey and comparison of methods for finding all vertices of convex polyhedral sets,\u201dMathematics of Operations Research 5 (1980) 167\u2013185.","journal-title":"Mathematics of Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry \u2014 An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"F.P. Preparata and M.I. Shamos,Computational Geometry \u2014 An Introduction (Springer, New York, 1985)."},{"key":"CR13","volume-title":"Algorithms","author":"R. Sedgewick","year":"1983","unstructured":"R. Sedgewick, Algorithms (Addison\u2014Wesley, Reading, MA, 1983)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(86)90220-7","volume":"62","author":"B. Sturmfels","year":"1986","unstructured":"B. Sturmfels, \u201cCentral and parallel projections of polytopes,\u201dDiscrete Mathematics 62 (1986) 315\u2013318.","journal-title":"Discrete Mathematics"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(84)90092-1","volume":"9","author":"K. Sugihara","year":"1984","unstructured":"K. Sugihara, \u201cAn algebraic and combinatorial approach to the analysis of line drawings of polyhedra,\u201dDiscrete Applied Mathematics 9 (1984) 77\u2013104.","journal-title":"Discrete Applied Mathematics"},{"key":"CR16","first-page":"177","volume-title":"Computational Morphology","author":"K. Sugihara","year":"1988","unstructured":"K. Sugihara, \u201cRealizability of polyhedrons from line drawings,\u201d in: G. T. Toussaint, ed.,Computational Morphology (Elsevier, Amsterdam, 1988) pp. 177\u2013206."},{"key":"CR17","first-page":"13","volume":"7","author":"W. Whiteley","year":"1982","unstructured":"W. Whiteley, \u201cMotions and stresses of projected polyhedra,\u201dStructural Topology 7 (1982) 13\u201338.","journal-title":"Structural Topology"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582886.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582886\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:55Z","timestamp":1556896555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF01582886"],"URL":"https:\/\/doi.org\/10.1007\/bf01582886","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}