{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:18:23Z","timestamp":1760440703680},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T00:00:00Z","timestamp":1190073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00454-007-9026-x","type":"journal-article","created":{"date-parts":[[2007,9,17]],"date-time":"2007-09-17T13:32:51Z","timestamp":1190035971000},"page":"31-46","source":"Crossref","is-referenced-by-count":5,"title":["Enumerating Constrained Non-crossing Minimally Rigid Frameworks"],"prefix":"10.1007","volume":"40","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","published-online":{"date-parts":[[2007,9,18]]},"reference":[{"key":"9026_CR1","unstructured":"Aichholzer, O., Aurenhammer, F., Huemer, C., Vogtenhuber, B.: Gray code enumeration of plane straight-line graphs. In: Proc. 22th European Workshop on Computational Geometry (EuroCG \u201906), pp.\u00a071\u201374, Greece, 2006"},{"issue":"2","key":"9026_CR2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0097-8493(96)00085-4","volume":"21","author":"M.V. Anglada","year":"1997","unstructured":"Anglada, M.V.: An improved incremental algorithm for constructing restricted Delaunay triangulations. Comput. Graph. 21(2), 215\u2013223 (1997)","journal-title":"Comput. Graph."},{"key":"9026_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"Avis, D., Fukuda, K.: A\u00a0pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom. 8, 295\u2013313 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"1-3","key":"9026_CR4","doi-asserted-by":"crossref","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 Appl. Math. 65(1-3), 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"Suppl.","key":"9026_CR5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00373-007-0709-0","volume":"23","author":"D. Avis","year":"2007","unstructured":"Avis, D., Katoh, N., Ohsaki, M., Streinu, I., Tanigawa, S.: Enumerating non-crossing minimally rigid frameworks. Graphs Comb. 23(Suppl.), 117\u2013134 (2007)","journal-title":"Graphs Comb."},{"key":"9026_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-1-4612-4248-2_2","volume-title":"Modelling, Mesh Generation and Adaptive Numerical Methods for Partial Differential Equations","author":"I. Beichl","year":"1995","unstructured":"Beichl, I., Sullivan, F.: Coping with degeneracies in Delaunay triangulation. In: Flaherty, J.E., et al. (eds.) Modelling, Mesh Generation and Adaptive Numerical Methods for Partial Differential Equations, pp. 23\u201330. Springer, New York (1995)"},{"key":"9026_CR7","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, Berlin (2003)"},{"issue":"3","key":"9026_CR8","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. 30(3), 207\u2013222 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9026_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/978-3-540-39658-1_10","volume-title":"Proc. 11th Annual European Symposium on Algorithms (ESA)","author":"A. Berg","year":"2003","unstructured":"Berg, A., Jord\u00e1n, T.: Algorithms for graph rigidity and scene analysis. In: Battista, G.D., Zwick, U. (eds.) Proc. 11th Annual European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 2832, pp. 78\u201389. Springer, Berlin (2003)"},{"key":"9026_CR10","doi-asserted-by":"crossref","unstructured":"Bern, M., Eppstein, D.: Mesh generation and optimal triangulation. In: Du and Hwang (eds.) Computing in Euclidean Geometry, 2nd edn., pp.\u00a023\u201390 (1992)","DOI":"10.1142\/9789814355858_0002"},{"issue":"2","key":"9026_CR11","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/S0097539795285916","volume":"28","author":"F. Chin","year":"1998","unstructured":"Chin, F., Wang, C.A.: Finding the constrained Delaunay triangulation and constrained Voronoi diagrams of a simple polygon in linear time. SIAM J. Comput. 28(2), 471\u2013486 (1998)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9026_CR12","first-page":"290","volume":"54","author":"L. Floriani de","year":"1992","unstructured":"de Floriani, L., Puppo, A.: An on-line algorithm for constrained Delaunay triangulation. Comput. Vis. Graph. Image Process. 54(3), 290\u2013300 (1992)","journal-title":"Comput. Vis. Graph. Image Process."},{"key":"9026_CR13","series-title":"Graduate Studies in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/002","volume-title":"Combinatorial Rigidity","author":"J. Graver","year":"1993","unstructured":"Graver, J., Servatius, B., Servatius, H.: Combinatorial Rigidity. Graduate Studies in Mathematics, vol.\u00a02. American Mathematical Society, Providence (1993)"},{"key":"9026_CR14","doi-asserted-by":"crossref","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.\u00a0Comput. Phys. 137, 346\u2013365 (1997)","journal-title":"J.\u00a0Comput. Phys."},{"issue":"4","key":"9026_CR15","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1007\/BF01990536","volume":"33","author":"K. Jansen","year":"1993","unstructured":"Jansen, K., Woeginger, G.J.: The complexity of detecting crossingfree configurations in the plane. BIT 33(4), 580\u2013595 (1993)","journal-title":"BIT"},{"key":"9026_CR16","unstructured":"Katoh, N., Ohsaki, M., Kinoshita, T., Tanigawa, S., Avis, D., Streinu, I.: Enumeration of optimal pin-jointed bistable mechanisms. In: Proc. 4th China-Japan-Korea Symp. of Structural and Mechanical Systems, Kunming, November 2006"},{"key":"9026_CR17","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":"9026_CR18","doi-asserted-by":"crossref","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. 27, 295\u2013299 (2004)","journal-title":"Struct. Multidisc. Optim."},{"key":"9026_CR19","doi-asserted-by":"crossref","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. J.\u00a0Eng. Math. 4, 331\u2013340 (1970)","journal-title":"J.\u00a0Eng. Math."},{"key":"9026_CR20","doi-asserted-by":"crossref","unstructured":"Lee, A., Streinu, I.: Pebble game algorithms and sparse graphs. In: Proc. EUROCOMB, Berlin, September 2005","DOI":"10.46298\/dmtcs.3394"},{"key":"9026_CR21","unstructured":"Lee, A., Streinu, I., Theran, L.: Finding and maintaining rigid components. In: Proc. Canad. Conf. Comp. Geom., Windsor, Canada, August 2005"},{"key":"9026_CR22","doi-asserted-by":"crossref","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 behaviour. Struct. Multidisc. Optim. 30, 327\u2013334 (2005)","journal-title":"Struct. Multidisc. Optim."},{"key":"9026_CR23","doi-asserted-by":"crossref","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. 34, 587\u2013635 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"9026_CR24","first-page":"481","volume-title":"Handbook of Combinatorics","author":"D.J.A. Welsh","year":"1995","unstructured":"Welsh, D.J.A.: Matroids: Fundamental concepts. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics, vol.\u00a0I, pp. 481\u2013526. North-Holland, Amsterdam (1995)"},{"key":"9026_CR25","first-page":"171","volume-title":"Matroid Theory","author":"W. Whiteley","year":"1997","unstructured":"Whiteley, W.: Matroids from discrete geometry. In: Bonin, J., Oxley, J., Servatius, B. (eds.) Matroid Theory, pp. 171\u2013313. AMS Contemporary Mathematics, Providence (1997)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9026-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-007-9026-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-007-9026-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T04:45:08Z","timestamp":1684039508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-007-9026-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,18]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9026"],"URL":"https:\/\/doi.org\/10.1007\/s00454-007-9026-x","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,18]]}}}