{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:56Z","timestamp":1725543116786},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_23","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"205-215","source":"Crossref","is-referenced-by-count":0,"title":["Enumerating Non-crossing Minimally Rigid Frameworks"],"prefix":"10.1007","author":[{"given":"David","family":"Avis","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Ohsaki","sequence":"additional","affiliation":[]},{"given":"Ileana","family":"Streinu","sequence":"additional","affiliation":[]},{"given":"Shin-ichi","family":"Tanigawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-45078-8_33","volume-title":"Algorithms and Data Structures","author":"O. Aichholzer","year":"2003","unstructured":"Aichholzer, O., Rote, G., Speckmann, B., Streinu, I.: The zig-zag path of a pseudo-triangulation. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 377\u2013388. Springer, Heidelberg (2003)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom.\u00a08, 295\u2013313 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"1-3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Applied Mathematics\u00a065(1-3), 21\u201346 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR4","volume-title":"Topology Optimization: Theory, Methods and Applications","author":"M.P. Bends\u00f8e","year":"2003","unstructured":"Bends\u00f8e, M.P., Sigmund, O.: Topology Optimization: Theory, Methods and Applications. Springer, Heidelberg (2003)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-39658-1_10","volume-title":"Algorithms - ESA 2003","author":"A. Berg","year":"2003","unstructured":"Berg, A., Jord\u00e1n, T.: Algorithms for graph rigidity and scene analysis. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 78\u201389. Springer, Heidelberg (2003)"},{"issue":"3","key":"23_CR6","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0925-7721(02)00111-6","volume":"23","author":"S. Bespamyatnikh","year":"2002","unstructured":"Bespamyatnikh, S.: An efficient algorithm for enumeration of triangulations. Comput. Geom. Theory Appl.\u00a023(3), 271\u2013279 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"23_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.comgeo.2004.09.002","volume":"30","author":"S. Bereg","year":"2005","unstructured":"Bereg, S.: Enumerating pseudo-triangulations in the plane. Comput. Geom. Theory Appl.\u00a030(3), 207\u2013222 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Br\u00f6nnimann, H., Kettner, L., Pocchiola, M., Snoeyink, J.: Enumerating and counting pseudo-triangulations with the greedy flip algorithm. In: ALENEX, Vancouver, Canada (2005)","DOI":"10.1137\/050631008"},{"issue":"1-2","key":"23_CR9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(01)00031-1","volume":"20","author":"A. Dumitrescu","year":"2001","unstructured":"Dumitrescu, A., G\u00e4rtner, B., Pedroni, S., Welzl, E.: Enumerating triangulation paths. Comput. Geom. Theory Appli.\u00a020(1-2), 3\u201312 (2001)","journal-title":"Comput. Geom. Theory Appli."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. Graduate Studies in Mathematics, vol.\u00a02. American Mathematical Society (1993)","DOI":"10.1090\/gsm\/002"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jcph.1997.5809","volume":"137","author":"D.J. Jacobs","year":"1997","unstructured":"Jacobs, D.J., Hendrickson, B.: An algorithm for two-dimensional rigidity percolation: the pebble game. J. Comput. Physics\u00a0137, 346\u2013365 (1997)","journal-title":"J. Comput. Physics"},{"key":"23_CR12","volume-title":"Structural Mechanics: Graph and Matrix Methods","author":"A. Kaveh","year":"2004","unstructured":"Kaveh, A.: Structural Mechanics: Graph and Matrix Methods, 3rd edn. Research Studies Press, Somerset (2004)","edition":"3"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00158-004-0409-9","volume":"27","author":"A. Kawamoto","year":"2004","unstructured":"Kawamoto, A., Bends\u00f8e, M., Sigmund, O.: Planar articulated mechanism design by graph theoretical enumeration. Struct. Multidisc. Optim.\u00a027, 295\u2013299 (2004)","journal-title":"Struct. Multidisc. Optim."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G. Laman","year":"1970","unstructured":"Laman, G.: On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics\u00a04, 331\u2013340 (1970)","journal-title":"Journal of Engineering Mathematics"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Lee, A., Streinu, I.: Pebble game algorihms and sparse graphs. In: Proc. EUROCOMB, Berlin (September 2005)","DOI":"10.46298\/dmtcs.3394"},{"key":"23_CR16","unstructured":"Lee, A., Streinu, I., Theran, L.: Finding and maintaining rigid components. In: Proc. Canad. Conf. Comp. Geom., Windsor, Canada (August 2005)"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00158-005-0532-2","volume":"30","author":"M. Ohsaki","year":"2005","unstructured":"Ohsaki, M., Nishiwaki, S.: Shape design of pin-jointed multi-stable compliant mechanisms using snapthrough behavior. Struct. Multidisc. Optim.\u00a030, 327\u2013334 (2005)","journal-title":"Struct. Multidisc. Optim."},{"key":"23_CR18","first-page":"699","volume-title":"Discrete and Computational Geometry - The Goodman-Pollack Festschrift, Algorithms and Combinatorics","author":"G. Rote","year":"2003","unstructured":"Rote, G., Santos, F., Streinu, I.: Expansive motions and the polytope of pointed pseudo-triangulations. In: Boris Aronov, J.P., Basu, S., Sharir, M. (eds.) Discrete and Computational Geometry - The Goodman-Pollack Festschrift, Algorithms and Combinatorics, pp. 699\u2013736. Springer, Berlin (2003)"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00454-005-1184-0","volume":"34","author":"I. Streinu","year":"2005","unstructured":"Streinu, I.: Pseudo-triangulations, rigidity and motion planning. Discrete Comput. Geom.\u00a034, 587\u2013635 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"23_CR20","first-page":"21","volume":"11","author":"T.S. Tay","year":"1985","unstructured":"Tay, T.S., Whiteley, W.: Generating isostatic frameworks. Structural Topology\u00a011, 21\u201369 (1985)","journal-title":"Structural Topology"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T14:38:33Z","timestamp":1683556713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11809678_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}