乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:44Z","timestamp":1725489824973},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_35","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"398-409","source":"Crossref","is-referenced-by-count":2,"title":["Cauchy\u2019s Theorem and Edge Lengths of Convex Polyhedra"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Spriggs","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","volume-title":"Proofs from the Book","author":"M. Aigner","year":"2003","unstructured":"Aigner, M., Ziegler, G.M.: Proofs from the Book, 3rd edn. Springer, Heidelberg (2003)","edition":"3"},{"key":"35_CR2","unstructured":"Alboul, L., Echeverria, G., Rodgrigues, M.: Discrete curvatures and gauss maps for polyhedral surfaces. In: European Workshop on Computational Geometry (2005), http:\/\/www.win.tue.nl\/EWCG2005\/Proceedings\/18.pdf"},{"key":"35_CR3","volume-title":"Convex Polyhedra","author":"A.D. Alexandrov","year":"2005","unstructured":"Alexandrov, A.D.: Convex Polyhedra. Springer, Heidelberg (2005)"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discrete Math.\u00a09, 349\u2013359 (1996)","journal-title":"SIAM J. Discrete Math."},{"key":"35_CR5","unstructured":"Bobenko, A.I., Izmestiev, I.: Alexandrov\u2019s theorem, weighted delaunay triangulations, and mixed volumes (2006), http:\/\/www.citebase.org\/"},{"key":"35_CR6","volume-title":"Polyhedra","author":"P.R. Cromwell","year":"1997","unstructured":"Cromwell, P.R.: Polyhedra. Cambridge University Press, Cambridge (1997)"},{"key":"35_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0925-7721(97)00006-0","volume":"8","author":"G. Das","year":"1997","unstructured":"Das, G., Goodrich, M.T.: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees. Computational Geometry Theory and Applications\u00a08, 123\u2013137 (1997)","journal-title":"Computational Geometry Theory and Applications"},{"key":"35_CR8","unstructured":"Demaine, E.D., Erickson, J.: Open problems on polytope reconstruction (July 1999), http:\/\/theory.csail.mit.edu\/~edemaine\/papers\/PolytopeReconstruction\/"},{"key":"35_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511735172","volume-title":"Geometric Folding Algorithms: Linkages, Origami, and Polyhedra","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., O\u2019Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, and Polyhedra. Cambridge University Press, Cambridge (2007)"},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0925-7721(98)00039-X","volume":"11","author":"O. Devillers","year":"1998","unstructured":"Devillers, O., Liotta, G., Preparata, F., Tamassia, R.: Checking the convexity of polytopes and the planarity of subdivisions. Computational Geometry: Theory and Applications\u00a011, 187\u2013208 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"35_CR11","first-page":"217","volume-title":"Proc. International Congress of Mathematicians","author":"D. Gale","year":"1954","unstructured":"Gale, D.: Irreducible convex sets. In: Proc. International Congress of Mathematicians, vol.\u00a0II, pp. 217\u2013218. North-Holland, Amsterdam (1954)"},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0925-7721(97)00016-3","volume":"9","author":"A. Garg","year":"1998","unstructured":"Garg, A.: New results on drawing angle graphs. Computational Geometry Theory and Applications\u00a09, 43\u201382 (1998)","journal-title":"Computational Geometry Theory and Applications"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/cpa.3160050302","volume":"5","author":"J. Heijenoort Van","year":"1952","unstructured":"Van Heijenoort, J.: On locally convex manifolds. Communications on Pure and Applied Mathematics\u00a05, 223\u2013242 (1952)","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Pfetsch, M.E.: Some algorithmic problems in polytope theory. Algebra, Geometry, and Software Systems 23\u201347 (2003)","DOI":"10.1007\/978-3-662-05148-1_2"},{"key":"35_CR15","unstructured":"Lucier, B.: Unfolding and reconstructing polyhedra. Master\u2019s thesis, David R. Cheriton School of Computer Science, University of Waterloo (2006)"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF00149284","volume":"2","author":"P. McMullen","year":"1973","unstructured":"McMullen, P.: Representations of polytopes and polyhedral sets. Geometriae Dedicata\u00a02, 83\u201399 (1973)","journal-title":"Geometriae Dedicata"},{"key":"35_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0925-7721(98)00036-4","volume":"12","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S., Seel, M., Schilz, T., Schirra, S., Uhrig, C.: Checking geometric programs or verification of geometry structures. Computational Geometry: Theory and Applications\u00a012, 85\u2013103 (1999)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.2307\/1996951","volume":"190","author":"W. Meyer","year":"1974","unstructured":"Meyer, W.: Indecomposable polytopes. Transactions of the American Mathematical Society\u00a0190, 77\u201386 (1974)","journal-title":"Transactions of the American Mathematical Society"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J.: Computational geometry column. SIGACT News 38(2) (to appear)","DOI":"10.1145\/1272729.1272740"},{"key":"35_CR20","unstructured":"Rybnikov, K.A.: Fast verification of convexity of piecewise-linear surfaces. CoRR, cs.CG\/0309041 (2003), http:\/\/arxiv.org\/abs\/cs.CG\/0309041"},{"issue":"4","key":"35_CR21","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/PL00009393","volume":"20","author":"I.K.. Sabitov","year":"1998","unstructured":"Sabitov, I.K.: The volume as a metric invariant of polyhedra. Discrete and Computational Geometry\u00a020(4), 405\u2013425 (1998)","journal-title":"Discrete and Computational Geometry"},{"key":"35_CR22","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"issue":"3","key":"35_CR23","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/PL00013391","volume":"17","author":"A. Sheffer","year":"2001","unstructured":"Sheffer, A., de Sturler, E.: Parameterization of faceted surfaces for meshing using angle based flattening. Engineering with Computers\u00a017(3), 326\u2013337 (2001)","journal-title":"Engineering with Computers"},{"key":"35_CR24","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00607-004-0056-9","volume":"72","author":"A. Sheffer","year":"2004","unstructured":"Sheffer, A., Gotsman, C., Dyn, N.: Robust spherical parameterization of triangular meshes. Computing\u00a072, 185\u2013193 (2004)","journal-title":"Computing"},{"key":"35_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1112\/S0025579300003995","volume":"10","author":"G.C. Shephard","year":"1963","unstructured":"Shephard, G.C.: Decomposable convex polyhedra. Mathematika\u00a010, 89\u201395 (1963)","journal-title":"Mathematika"},{"key":"35_CR26","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1002\/cpa.3160210203","volume":"11","author":"J.J. Stoker","year":"1968","unstructured":"Stoker, J.J.: Geometrical problems concering polyhedra in the large. Communications on Pure and Applied Mathematics\u00a011, 119\u2013168 (1968)","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"35_CR27","doi-asserted-by":"crossref","unstructured":"Vijayan, G.: Geometry of planar graphs with angles. In: Proc. 2nd Annual ACM Symposium on Computational Geometry, pp. 116\u2013124 (1986)","DOI":"10.1145\/10515.10528"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:57Z","timestamp":1619517957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}