{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T15:16:55Z","timestamp":1778080615277,"version":"3.51.4"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2006,7]]},"abstract":"<jats:p>\"Symmetry is a complexity-reducing concept [...]; seek it every-where.\" - Alan J. PerlisMany natural and man-made objects exhibit significant symmetries or contain repeated substructures. This paper presents a new algorithm that processes geometric models and efficiently discovers and extracts a compact representation of their Euclidean symmetries. These symmetries can be partial, approximate, or both. The method is based on matching simple local shape signatures in pairs and using these matches to accumulate evidence for symmetries in an appropriate transformation space. A clustering stage extracts potential significant symmetries of the object, followed by a verification step. Based on a statistical sampling analysis, we provide theoretical guarantees on the success rate of our algorithm. The extracted symmetry graph representation captures important high-level information about the structure of a geometric model which in turn enables a large set of further processing operations, including shape compression, segmentation, consistent editing, symmetrization, indexing for retrieval, etc.<\/jats:p>","DOI":"10.1145\/1141911.1141924","type":"journal-article","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T14:14:26Z","timestamp":1153836866000},"page":"560-568","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":392,"title":["Partial and approximate symmetry detection for 3D geometry"],"prefix":"10.1145","volume":"25","author":[{"given":"Niloy J.","family":"Mitra","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas J.","family":"Guibas","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Pauly","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,7]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882296"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187910"},{"key":"e_1_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Amato N. M. Bayazit O. B. Dale L. K. Jones C. and Vallejo D. 2000. Choosing good distance metrics and local planners for probabilistic roadmap methods. In IEEE Trans. on Robotics and Automation 442--447. Amato N. M. Bayazit O. B. Dale L. K. Jones C. and Vallejo D. 2000. Choosing good distance metrics and local planners for probabilistic roadmap methods. In IEEE Trans. on Robotics and Automation 442--447.","DOI":"10.1109\/70.864240"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276889"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000787"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1985.1676605"},{"key":"e_1_2_2_8_1","volume-title":"Symposium on Geometry Processing, 9--18","author":"Boissonnat J. D."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/777792.777839"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.1000236"},{"key":"e_1_2_2_11_1","unstructured":"Cox T. and Cox M. 1994. Multidimensional Scaling. Chapman and Hall London. Cox T. and Cox M. 1994. Multidimensional Scaling. Chapman and Hall London."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/358669.358692"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122501.1122507"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/322248.322254"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2944226.2944376"},{"key":"e_1_2_2_16_1","volume-title":"International Conference on High Energy Accelerators and Instrumentation.","author":"Hough P.","year":"1959"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073206"},{"key":"e_1_2_2_18_1","volume-title":"Proceedings of ECCV, 642--656","author":"Kazhdan M. M."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057432.1057448"},{"key":"e_1_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Klein F. 1893. Vergleichende betrachtungen ber neuere geometrische forschungen. Mathematische Annalen 43. Klein F. 1893. Vergleichende betrachtungen ber neuere geometrische forschungen. Mathematische Annalen 43.","DOI":"10.1007\/BF01446615"},{"key":"e_1_2_2_21_1","volume-title":"Proceedings of ICCV, 238--249","author":"Lamdan Y."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262332"},{"key":"e_1_2_2_23_1","volume-title":"Proceedings of ECCV","author":"Loy G."},{"key":"e_1_2_2_24_1","unstructured":"Magnus W. Karrass A. and Solitar D. 2004. Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations. Dover. Magnus W. Karrass A. and Solitar D. 2004. Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations. Dover."},{"key":"e_1_2_2_25_1","volume-title":"Proceedings of ECCV, 87--99","author":"Manay S."},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1057432.1057435"},{"key":"e_1_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Motwani R. and Raghavan P. 1995. Randomized Algorithms. Cambridge University Press. Motwani R. and Raghavan P. 1995. Randomized Algorithms. Cambridge University Press.","DOI":"10.1017\/CBO9780511814075"},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Raab M. and Steger A. 1998. \"balls into bins\" --- A simple and tight analysis. Lecture Notes in Computer Science. Raab M. and Steger A. 1998. \"balls into bins\" --- A simple and tight analysis. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-49543-6_13"},{"key":"e_1_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Rusinkiewicz S. and Levoy M. 2001. Efficient variants of the icp algorithm. In 3DIM 145--152. Rusinkiewicz S. and Levoy M. 2001. Efficient variants of the icp algorithm. In 3DIM 145--152.","DOI":"10.1109\/IM.2001.924423"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.574800"},{"key":"e_1_2_2_31_1","unstructured":"Thompson D. W. 1961. On Growth and Form. Cambridge. Thompson D. W. 1961. On Growth and Form. Cambridge."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.226"},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Wolter J. Woo T. and Volz R. 1985. Optimal algorithms for symmetry detection in two and three dimensions. The Visual Computer. Wolter J. Woo T. and Volz R. 1985. Optimal algorithms for symmetry detection in two and three dimensions. The Visual Computer.","DOI":"10.1007\/BF01901268"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.476508"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141911.1141924","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1141911.1141924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:23Z","timestamp":1750259663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141911.1141924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["10.1145\/1141911.1141924"],"URL":"https:\/\/doi.org\/10.1145\/1141911.1141924","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]},"assertion":[{"value":"2006-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}