{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:04:14Z","timestamp":1648843454356},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6-8","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00371-015-1114-y","type":"journal-article","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T12:02:56Z","timestamp":1430395376000},"page":"893-904","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient multi-constrained optimization for example-based synthesis"],"prefix":"10.1007","volume":"31","author":[{"given":"Stefan","family":"Hartmann","sequence":"first","affiliation":[]},{"given":"Elena","family":"Trunz","sequence":"additional","affiliation":[]},{"given":"Bj\u00f6rn","family":"Kr\u00fcger","sequence":"additional","affiliation":[]},{"given":"Reinhard","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Matthias B.","family":"Hullin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,1]]},"reference":[{"key":"1114_CR1","doi-asserted-by":"crossref","unstructured":"Bokeloh, M., Wand, M., Seidel, H.-P.: A connection between partial symmetry and inverse procedural modeling. In: ACM SIGGRAPH 2010 Papers, SIGGRAPH \u201910, Los Angeles, California, pp. 104:1\u2013104:10 (2010)","DOI":"10.1145\/1833349.1778841"},{"key":"1114_CR2","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Finding the $$k$$ k shortest paths. In: Proceedings of the 35th symposium on Foundations of Computer Science, pp. 154\u2013165. IEEE, November 1994","DOI":"10.1109\/SFCS.1994.365697"},{"key":"1114_CR3","unstructured":"Garcia, R.: Resource constrained shortest paths and extensions. PhD thesis, Georgia Institute of Technology (2009)"},{"key":"1114_CR4","unstructured":"Horswill, I.D., Foged, L.: Fast procedural level population with playability constraints. In AIIDE (2012)"},{"issue":"3","key":"1114_CR5","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1145\/566654.566605","volume":"21","author":"L Kovar","year":"2002","unstructured":"Kovar, L., Gleicher, M., Pighin, F.: Motion graphs. ACM Trans. Graph. (Proc. SIGGRAPH) 21(3), 473\u2013482 (2002)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"key":"1114_CR6","doi-asserted-by":"crossref","unstructured":"Kovar, L., Gleicher, M., Schreiner, J.: Footskate cleanup for motion capture editing. In ACM SIGGRAPH symposium on computer animation, pp. 97\u2013104 (2002)","DOI":"10.1145\/545261.545277"},{"key":"1114_CR7","unstructured":"Kr\u00fcger, B., Tautges, J., Weber, A., Zinke, A.: Fast local and global similarity searches in large motion capture databases. In ACM SIGGRAPH symposium on computer animation, pp. 1\u201310, July 2010"},{"issue":"1","key":"1114_CR8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s00371-013-0902-5","volume":"31","author":"R Lan","year":"2015","unstructured":"Lan, R., Sun, H.: Automated human motion segmentation via motion regularities. Vis. Comput. 31(1), 35\u201353 (2015)","journal-title":"Vis. Comput."},{"issue":"5","key":"1114_CR9","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1145\/566654.566607","volume":"31","author":"J Lee","year":"2002","unstructured":"Lee, J., Chai, J., Reitsma, P.S.A., Hodgins, J.K., Pollard, N.S.: Interactive control of avatars animated with human motion data. ACM Trans. Graph. (Proc. SIGGRAPH) 31(5), 491\u2013500 (2002)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"key":"1114_CR10","doi-asserted-by":"crossref","unstructured":"Lefebvre, S., Hornus, S., Lasram, A.: By-example synthesis of architectural textures. In: ACM SIGGRAPH 2010 Papers, SIGGRAPH \u201910, Los Angeles, California, pp. 84:1\u201384:8 (2010)","DOI":"10.1145\/1833349.1778821"},{"issue":"2","key":"1114_CR11","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1111\/j.1467-8659.2009.01626.x","volume":"29","author":"W-Y Lo","year":"2010","unstructured":"Lo, W.-Y., Zwicker, M.: Bidirectional search for interactive motion synthesis. Comput. Graph. Forum 29(2), 563\u2013573 (2010)","journal-title":"Comput. Graph. Forum"},{"key":"1114_CR12","doi-asserted-by":"crossref","unstructured":"Merrell, P., Manocha, D.: Constraint-based model synthesis. In SIAM\/ACM conference on geometric and physical modeling, pp. 101\u2013111, (2009)","DOI":"10.1145\/1629255.1629269"},{"issue":"6","key":"1114_CR13","first-page":"153:1","volume":"31","author":"J Min","year":"2012","unstructured":"Min, J., Chai, J.: Motion graphs++: a compact generative model for semantic motion analysis and synthesis. ACM Trans. Graph. 31(6), 153:1\u2013153:12 (2012)","journal-title":"ACM Trans. Graph."},{"key":"1114_CR14","unstructured":"M\u00fcller, M., R\u00f6der, T., Clausen, M., Eberhardt, B., Kr\u00fcger, B., Weber, A.: Documentation Mocap Database HDM05. Technical Report CG-2007-2, Universit\u00e4t Bonn, June 2007"},{"issue":"3","key":"1114_CR15","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1145\/1141911.1141931","volume":"25","author":"P M\u00fcller","year":"2006","unstructured":"M\u00fcller, P., Wonka, P., Haegler, S., Ulmer, A., Van Gool, L.: Procedural modeling of buildings. ACM Trans. Graph. (Proc. SIGGRAPH) 25(3), 614\u2013623 (2006)","journal-title":"ACM Trans. Graph. (Proc. SIGGRAPH)"},{"issue":"2","key":"1114_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0166-218X(85)90007-1","volume":"10","author":"CC Ribeiro","year":"1985","unstructured":"Ribeiro, C.C., Minoux, M.: A heuristic approach to hard constrained shortest path problems. Discret. Appl. Math. 10(2), 125\u2013137 (1985)","journal-title":"Discret. Appl. Math."},{"key":"1114_CR17","doi-asserted-by":"crossref","unstructured":"Safonova, A., Hodgins, J.K.: Construction and optimal search of interpolated motion graphs. In: ACM SIGGRAPH 2007 Papers, SIGGRAPH \u201907, Los Angeles, California (2007)","DOI":"10.1145\/1275808.1276510"},{"key":"1114_CR18","doi-asserted-by":"crossref","unstructured":"Smith, G., Treanor, M., Whitehead, J., Mateas, M.: Rhythm-based level generation for 2d platformers. In: Conference on Foundations of Digital Games, pp. 175\u2013182 (2009)","DOI":"10.1145\/1536513.1536548"},{"issue":"2","key":"1114_CR19","doi-asserted-by":"crossref","first-page":"11:1","DOI":"10.1145\/1944846.1944851","volume":"30","author":"JO Talton","year":"2011","unstructured":"Talton, J.O., Lou, Y., Lesser, S., Duke, J., M\u011bch, R., Koltun, V.: Metropolis procedural modeling. ACM Trans. Graph. 30(2), 11:1\u201311:14 (2011)","journal-title":"ACM Trans. Graph."},{"issue":"2","key":"1114_CR20","first-page":"91","volume":"6","author":"L Turner","year":"2011","unstructured":"Turner, L.: Variants of shortest path problems. Algorithm. Oper. Res. 6(2), 91\u2013104 (2011)","journal-title":"Algorithm. Oper. Res."},{"key":"1114_CR21","unstructured":"V\u00f6gele, A., Kr\u00fcger, B., Klein, R.: Efficient unsupervised temporal segmentation of human motion. In ACM SCA, July 2014"},{"issue":"2","key":"1114_CR22","first-page":"345","volume":"32","author":"S Wenner","year":"2013","unstructured":"Wenner, S., Bazin, J.-C., Sorkine-Hornung, A., Kim, C., Gross, M.: Scalable music: automatic music retargeting and synthesis. Proc. Eurograph. 32(2), 345\u2013354 (2013)","journal-title":"Proc. Eurograph."},{"issue":"1","key":"1114_CR23","first-page":"614","volume":"32","author":"Y Yeh","year":"2012","unstructured":"Yeh, Y., Breeden, K., Yang, L., Fisher, M., Hanrahan, P.: Synthesis of tiled patterns using factor graphs. ACM Trans. Graph. 32(1), 614\u2013623 (2012)","journal-title":"ACM Trans. Graph."},{"key":"1114_CR24","doi-asserted-by":"crossref","unstructured":"Zhou, F., De la Torre, F., Hodgins, J.: Aligned cluster analysis for temporal segmentation of human motion. In: IEEE conference on Automatic Face and Gestures Recognition (2008)","DOI":"10.1109\/AFGR.2008.4813468"},{"key":"1114_CR25","doi-asserted-by":"crossref","unstructured":"Zhou, S., Jiang, C., Lefebvre, S.: Topology-constrained synthesis of vector patterns. ACM Trans. Graph. 33(6), 215:1\u2013215:11 (2014)","DOI":"10.1145\/2661229.2661238"},{"key":"1114_CR26","doi-asserted-by":"crossref","unstructured":"Zhou, S., Lasram, A., Lefebvre, S.: By-example synthesis of curvilinear structured patterns. Comput. Graph. Forum 32(2), 355\u2013360 (2013)","DOI":"10.1111\/cgf.12055"},{"issue":"2","key":"1114_CR27","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.cor.2011.03.008","volume":"39","author":"X Zhu","year":"2012","unstructured":"Zhu, X., Wilhelm, W.E.: A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation. Comput. Oper. Res. 39(2), 164\u2013178 (2012)","journal-title":"Comput. Oper. Res."},{"key":"1114_CR28","unstructured":"Ziegelmann, M.: Constrained shortest paths and related problems. PhD thesis, Saarland University (2004)"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-015-1114-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-015-1114-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-015-1114-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T16:19:18Z","timestamp":1598977158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-015-1114-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,1]]},"references-count":28,"journal-issue":{"issue":"6-8","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["1114"],"URL":"https:\/\/doi.org\/10.1007\/s00371-015-1114-y","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,1]]}}}