Skip to content

Frahan StonePack Thesis — Consolidated Bibliography

Sole author: Independent Research. Open data, open source.

This is the consolidated reference list for the thesis. It contains every work cited anywhere in the fifteen chapters and the binding sections. It merges three sources: (1) every [Algorithm("title","Author Year ... venue", Doi=...)] and Note/WikiPath attribute across src/ (262 attribute occurrences, 138 files); (2) the curated citation library wiki/index/references.md; (3) the bibliographies of the two submitted papers (MASTER_PAPER.tex and MASTER_PAPER_BoEGE.tex). Works are deduplicated, normalised, grouped by theme, and keyed [Rn]. A work appears once even when cited by many components or by both papers.

In-text citation style is author-date, e.g. (Kao et al. 2022). The [Rn] key is the stable cross-reference used by the chapter files.

References

A. 2D packing and nesting

[R1] Burke, E.K., Hellier, R., Kendall, G., Whitwell, G. (2006). A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem. Operations Research 54(3):587-601. DOI 10.1287/opre.1060.0293.

[R2] Burke, E.K., Hellier, R., Kendall, G., Whitwell, G. (2007). Complete and robust no-fit polygon generation for the irregular stock cutting problem. European Journal of Operational Research 179(1):27-49. DOI 10.1016/j.ejor.2006.03.011.

[R3] Bennell, J.A., Oliveira, J.F. (2009). A tutorial in irregular shape packing problems. Journal of the Operational Research Society 60(supp 1):S93-S105. DOI 10.1057/jors.2008.169.

[R4] Baker, B.S., Coffman, E.G., Rivest, R.L. (1980). Orthogonal packings in two dimensions. SIAM Journal on Computing 9(4):846-855. DOI 10.1137/0209064.

[R5] Jones, D.R. (2013). A fully general, exact algorithm for nesting irregular shapes (QP-Nest). Journal of Global Optimization 56:587-628. DOI 10.1007/s10898-012-9954-8.

[R6] Bennell, J.A., Cabo, M., Martinez-Sykora, A. (2018). A beam search approach to solve the convex irregular bin packing problem with guillotine cuts. European Journal of Operational Research 270:89-102. DOI 10.1016/j.ejor.2018.03.029.

B. 3D packing and cutting stock

[R7] Chehrazad, R., Roose, D., Wauters, T. (2025). A fast and scalable deepest-left-bottom-fill algorithm for the 3D bin packing problem. International Journal of Production Research 63:6606-6629. DOI 10.1080/00207543.2025.2478434.

[R8] Park, J., Han, S. (2024). Tree-packing for irregular 3D containers (tree-search 3D-BPP / orthogonal-block packing).

[R9] Kim, T. (2025). Packing and cutting stone blocks based on the nonlinear programming of tree cases. Computation 13(9):211. DOI 10.3390/computation13090211.

[R10] Lodi, A., Martello, S., Vigo, D. (1999). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing 11:345-357. DOI 10.1287/ijoc.11.4.345.

[R11] Gilmore, P.C., Gomory, R.E. (1965). Multistage cutting stock problems of two and more dimensions. Operations Research 13:94-120. DOI 10.1287/opre.13.1.94.

[R12] Cherri, A.C., Arenales, M.N., Yanasse, H.H. (2009). The one-dimensional cutting stock problem with usable leftover — a heuristic approach. European Journal of Operational Research 196:897-908. DOI 10.1016/j.ejor.2008.04.039.

[R13] Khan, A., Pittu, E. (2020). On guillotine separability of squares and rectangles. APPROX/RANDOM 2020, LIPIcs vol 176, Schloss Dagstuhl, pp 47:1-47:22. DOI 10.4230/LIPIcs.APPROX/RANDOM.2020.47.

[R14] Wei, J., Liu, M., Wang, J. et al. (2022). Approximate convex decomposition for 3D meshes with collision-aware concavity and tree search (CoACD). ACM Transactions on Graphics (SIGGRAPH 2022) 41(4):42. DOI 10.1145/3528223.3530103.

C. Dimension-stone optimisation and quarrying

[R15] Elkarmoty, M., Bondua, S., Bruno, R. (2020). A 3D brute-force algorithm for the optimum cutting pattern of dimension stone quarries. Resources Policy 68:101761. DOI 10.1016/j.resourpol.2020.101761.

[R16] Elkarmoty, M., Colla, C., Gabrielli, E., Kasmaeeyazdi, S., Tinti, F., Bondua, S., Bruno, R. (2017). Mapping and modelling fractures using ground penetrating radar for ornamental stone assessment and recovery optimization: two case studies. Mining-Geology-Petroleum Engineering Bulletin (Rudarsko-geolosko-naftni zbornik) 32(4):63-76. DOI 10.17794/rgn.2017.4.7.

[R17] Marvie Reed, K., Bondua, S. (2025). A review of the state-of-the-art optimization algorithms for dimensional stone cutting. Revista Minelor / Mining Revue 31(2):31-37. DOI 10.2478/minrv-2025-0015.

[R18] Mosch, S., Nikolayew, D., Ewiak, O., Siegesmund, S. (2010). Optimized extraction of dimension stone blocks. Environmental Earth Sciences 63:1911-1924. DOI 10.1007/s12665-010-0825-7.

[R19] Yavuz, A.B., Turk, N., Koca, M.Y. (2005). Geological parameters affecting the marble production in the quarries along the southern flank of the Menderes Massif, SW Turkey. Engineering Geology 80:214-241. DOI 10.1016/j.enggeo.2005.05.003.

[R20] Yarahmadi, R., Bagherpour, R., Taherian, S.G., Sousa, L.M.O. (2018). Discontinuity modelling and rock block geometry identification to optimize production in dimension stone quarries. Engineering Geology 232:22-33. DOI 10.1016/j.enggeo.2017.11.006.

[R21] Ulker, E., Turanboy, A. (2009). Maximum volume cuboids for arbitrarily shaped in-situ rock blocks as determined by discontinuity analysis — a genetic algorithm approach. Computers & Geosciences 35:1470-1480. DOI 10.1016/j.cageo.2008.08.017.

[R22] Sousa, L.M.O. (2007). Granite fracture index to check suitability of granite outcrops for quarrying. Engineering Geology 92(3-4):146-159. DOI 10.1016/j.enggeo.2007.04.001.

[R23] Jalalian, M.H., Bagherpour, R., Khoshouei, M. (2023). Environmentally sustainable mining in quarries to reduce waste production and loss of resources using the developed optimization algorithm (BCSdbBV). Scientific Reports 13:22183. DOI 10.1038/s41598-023-49633-w.

[R24] Goodman, R.E., Shi, G.-h. (1985). Block theory and its application to rock engineering. Prentice-Hall, Englewood Cliffs. ISBN 978-0130781895.

[R25] Mutlu, M., Elci, H., Selcuk, A. (2007). BlockCutOpt block-cutting optimisation lineage (dimension-stone cut planning).

[R26] Shao, H., Liu, Q., Gao, Z. (2022). Material removal optimization strategy of 3D block cutting based on geometric computation method (AMRR in-block plane-sequence cutting). Processes (MDPI) 10(4):695. DOI 10.3390/pr10040695.

[R27] Konstanty, J.S. (2021). The mechanics of sawing granite with diamond wire. International Journal of Advanced Manufacturing Technology 116:2591-2597. DOI 10.1007/s00170-021-07577-3.

[R28] Raza, M.A., Raza, S., Khan, M.U., Emad, M.Z., Jalil, K., Saki, S.A. (2024). Cost modelling for dimension stone quarry operations. Journal of the Southern African Institute of Mining and Metallurgy 123:521-525. DOI 10.17159/2411-9717/1578/2023.

[R29] Kapageridis, I., Albanopoulos, C. (2018). Resource and reserve estimation for a marble quarry using quality indicators. Journal of the Southern African Institute of Mining and Metallurgy 118(1):39-45. DOI 10.17159/2411-9717/2018/v118n1a5.

[R30] Guo, W., Liu, G., Li, J., Chai, S., Guo, S. (2024). Research on the method of determining the block size for an open-pit mine integrating mining parameters and shovel-truck operation efficiency. Scientific Reports 14. DOI 10.1038/s41598-024-52815-9.

[R31] Suresh, Uma Maheswaran, Tamilarasan, Ranjith Kumar, Anbazhagan (2020). Quality assessment and grading of dimension stone in Krishnagiri District, Tamil Nadu, India. Journal of Science and Technology 5(2):76.

[R32] Palmstrom, A. (2005). Measurements of and correlations between block size and rock quality designation (RQD). Tunnelling and Underground Space Technology 20:362-377. DOI 10.1016/j.tust.2005.01.005.

[R33] Cai, M., Kaiser, P.K., Uno, H., Tasaka, Y., Minami, M. (2004). Estimation of rock mass deformation modulus and strength of jointed hard rock masses using the GSI system. International Journal of Rock Mechanics and Mining Sciences 41(1):3-19. DOI 10.1016/S1365-1609(03)00025-X.

D. GPR and geophysics

[R34] Porsani, J.L., Sauck, W.A., Junior, A.O.S. (2006). GPR for mapping fractures and as a guide for the extraction of ornamental granite from a quarry: a case study from southern Brazil. Journal of Applied Geophysics 58:177-187. DOI 10.1016/j.jappgeo.2005.05.010.

[R35] Grasmueck, M., Weger, R., Horstmeyer, H. (2005). Full-resolution 3D GPR imaging. Geophysics 70:K12-K19. DOI 10.1190/1.1852780.

[R36] Molron, J., Linde, N., Baron, L., Selroos, J.O., Darcel, C., Davy, P. (2020). Which fractures are imaged with ground penetrating radar? Results from an experiment in the Aspo Hardrock Laboratory, Sweden. Engineering Geology 273:105674. DOI 10.1016/j.enggeo.2020.105674.

[R37] Dorn, C., Linde, N., Doetsch, J., Le Borgne, T., Bour, O. (2012). Fracture imaging within a granitic rock aquifer using multiple-offset single-hole and cross-hole GPR reflection data. Journal of Applied Geophysics 78:123-132. DOI 10.1016/j.jappgeo.2011.01.010.

[R38] Dorn, C., Linde, N., Le Borgne, T., Bour, O., de Dreuzy, J.R. (2013). Conditioning of stochastic 3-D fracture networks to hydrological and geophysical data. Advances in Water Resources 62:79-89. DOI 10.1016/j.advwatres.2013.10.005.

[R39] Annan, A.P. (2009). Electromagnetic principles of ground penetrating radar. In: Jol, H.M. (ed.) Ground penetrating radar: theory and applications. Elsevier, Amsterdam, pp 3-40. ISBN 9780444533487.

[R40] Neal, A. (2004). Ground-penetrating radar and its use in sedimentology: principles, problems and progress. Earth-Science Reviews 66:261-330. DOI 10.1016/j.earscirev.2004.01.004.

[R41] Xie, F., Lai, W.W.L., Derobert, X. (2021). GPR-based depth measurement of buried objects based on constrained least-square (CLS) fitting method of reflections. Measurement 168:108330. DOI 10.1016/j.measurement.2020.108330.

[R42] Zanzi, L., Izadi-Yazdanabadi, M., Karimi-Nasab, S., Arosio, D., Hojat, A. (2023). Time-lapse GPR measurements to monitor resin injection. Sensors 23(20):8490. DOI 10.3390/s23208490.

[R43] Huber, E., Hans, G. (2018). RGPR — an open-source package to process and visualize GPR data. 2018 17th International Conference on Ground Penetrating Radar (GPR), IEEE, pp 1-4. DOI 10.1109/ICGPR.2018.8441658.

[R44] Bondua, S., Monteiro Klen, A., Pilone, M., Asimopolos, L., Asimopolos, N.S. (2024). A set of ground penetrating radar measures from quarries. Data 9(3):42. DOI 10.3390/data9030042.

[R45] Lucius, J.E., Powers, M.H. (1999). USGS Open-File Report 02-166: GPR data-format documentation (pulseEKKO DT1/HD public-domain spec).

[R46] Anbazhagan, P., Guru, B., Biswal, T. (2011). Remote sensing in delineating deep fractured aquifer zones. In: Geoinformatics in applied geomorphology. CRC Press, Boca Raton, ch 12. ISBN 9781439830598.

[R160] Isakova, E. (2021). GPR survey of fractured Karelia granite (OKO-2, 150 / 1200 MHz antennas). (Cited for the high-energy fracture-reflector reading.)

[R161] USGS (1999). Mirror Lake GPR continuity protocol, Water-Resources Investigations Report 99-4018C (>=40-trace lateral-continuity criterion).

E. Fracture networks, DFN, and open fracture datasets

[R47] ISRM (1978). Suggested methods for the quantitative description of discontinuities in rock masses; with Priest, S.D. (1993). Discontinuity analysis for rock engineering. Chapman & Hall (joint-set DFN basis).

[R48] Aurenhammer, F. (1991). Voronoi diagrams — a survey of a fundamental geometric data structure. ACM Computing Surveys 23(3):345-405. DOI 10.1145/116873.116880.

[R49] Lei, Q., Latham, J.P., Tsang, C.F. (2017). The use of discrete fracture networks for modelling coupled geomechanical and hydrological behaviour of fractured rocks. Computers and Geotechnics 85:151-176. DOI 10.1016/j.compgeo.2016.12.024.

[R50] Davy, P., Le Goc, R., Darcel, C. (2013). A model of fracture nucleation, growth and arrest, and consequences for fracture density and scaling. Journal of Geophysical Research: Solid Earth 118:1393-1407. DOI 10.1002/jgrb.50120.

[R51] Berrone, S., Pieraccini, S., Scialo, S. (2016). Towards effective flow simulations in realistic discrete fracture networks. Journal of Computational Physics 310:181-201. DOI 10.1016/j.jcp.2016.01.009.

[R52] Azarafza, M. et al. (2016). Granite block-cut analysis with Fisher-distribution joint-orientation scatter.

[R53] Chudasama, B. (2022). Loviisa rapakivi-granite fracture and lineament dataset, southern Finland. Zenodo (open dataset, CC-BY 4.0).

[R54] Krietsch, H. et al. (2018). Grimsel granite borehole discrete-fracture-network dataset. (CC-BY 4.0).

[R55] Dowd, P.A. et al. (2009). Single-block granite discrete-fracture-network dataset.

[R56] Panara, Y. et al. (2024). GeoCrack and GeoFractNet: a CNN for automated rock-fracture digitisation (mIoU 0.91, MIT licensed).

[R162] Tian, W. (2025). Multi-model discrete fracture network generation (Baecher, Veneziano, Levy-Lee, Priest joint generators). Computers and Geotechnics. (Basis for the stochastic finite-disc DFN now built as Stochastic DFN (Baecher) D5F1004C; see chapter 03b.)

F. Masonry assembly, stability, and rigid-block analysis

[R57] Heyman, J. (1966). The stone skeleton (limit-state theorem of masonry; centre of thrust within the support). International Journal of Solids and Structures 2(2):249-279. DOI 10.1016/0020-7683(66)90018-7.

[R58] Kao, G.T.-C., Iannuzzo, A., Thomaszewski, B., Coros, S., Van Mele, T., Block, P. (2022). Coupled Rigid-Block Analysis: stability-aware design of complex discrete-element assemblies. Computer-Aided Design 146:103216. DOI 10.1016/j.cad.2022.103216.

[R59] Kim, T. (2024). Finding the installation sequence of polygonal masonry through design and depth search of a directed acyclic graph. ASME IDETC/CIE 2024, paper DETC2024-142563. (Cited by the polygonal-masonry sequencer and the Polygonal Wall generator substrate; distinct from the Kim 2025 Computation tree-packing paper [R9].)

[R60] Gramazio, F., Kohler, M., Eichenhofer, M. (2017). Robotic stone assembly. ETH Zurich, NCCR Digital Fabrication (gramaziokohler/ashlar). (Running-bond ashlar reference; the Best-Fit inventory lineage is Furrer 2017 [R61] / Johns 2020 [R62].)

[R61] Furrer, F., Wermelinger, M., Yoshida, H., Gramazio, F., Kohler, M., Siegwart, R., Hutter, M. (2017). Autonomous robotic stone stacking with online next-best-object target pose planning. IEEE ICRA 2017, pp 2350-2356. DOI 10.1109/ICRA.2017.7989273.

[R62] Johns, R.L., Wermelinger, M., Mascaro, R., Jud, D., Gramazio, F., Kohler, M., Chli, M., Hutter, M. (2020). Autonomous dry stone: on-site planning and assembly of stone walls with a robotic excavator. Construction Robotics 4:127-140. DOI 10.1007/s41693-020-00037-6.

[R63] Lu, C.-L., Zhu, Z., Olesti, G.P., Scully, P., Devadass, P. (2025). Computational design and robotic fabrication of dry-stacked non-standard spanning limestone assemblies. Construction Robotics. DOI 10.1007/s41693-026-00180-6 (journal); preprint DOI 10.21203/rs.3.rs-8019586/v1. CC-BY 4.0.

[R163] Whiting, E., Ochsendorf, J., Durand, F. (2009). Procedural modeling of structurally-sound masonry buildings. ACM Transactions on Graphics (SIGGRAPH Asia 2009) 28(5):112. DOI 10.1145/1618452.1618458. (Rigid-block-equilibrium masonry stability precedent, RBE lineage with Kao 2022 [R58].)

G. Stereotomy, voussoir geometry, and cathedral form-finding

[R64] Rippmann, M., Block, P. (2011). Digital stereotomy: voussoir geometry for freeform masonry-like vaults informed by structural and fabrication constraints. Proceedings of IABSE-IASS 2011, London.

[R65] Rippmann, M. (2016). Funicular shell design: geometric approaches to form finding and fabrication of discrete funicular structures. PhD thesis, ETH Zurich. DOI 10.3929/ethz-a-010656780.

[R66] Block, P., Van Mele, T., Rippmann, M., DeJong, M., Escobedo, D., Ochsendorf, J. (2016). Armadillo vault: beyond bending. Venice Architecture Biennale 2016. Nexus Network Journal funicular form-finding.

[R67] Varela, P.A.A. (2020). Reconstrucao de uma estereotomia (Stereotomy Semantic Classification taxonomy). PhD thesis, FAUP Porto, Repositorio Aberto handle 10216/170568.

[R68] Varela, P.A.A., Sousa, J.P. (2023). Stereotomic BIM. SIGraDi 2023 (cumincad sigradi2023_177).

[R69] Varela, P.A.A., Sousa, J.P. (2020). The Tamandua vault. eCAADe 2020. DOI 10.52842/conf.ecaade.2020.2.361.

[R70] Fallacara, G. (New Fundamentals Research Group, Politecnico di Bari). Contemporary stereotomy with digitally fabricated voussoirs.

[R71] Vitruvius (~25 BCE). De architectura (the ten books on architecture). Morgan, M.H. (trans., 1914), Harvard University Press / Loeb Classical Library.

[R148] Frezier, A.-F. (1737-1739). La theorie et la pratique de la coupe des pierres et des bois (the stereotomy treatise that coined stereotomie; the radial bed-joint rule).

[R149] Monge, G. (1798). Geometrie descriptive (lines of curvature for vault tessellation). Baudouin, Paris.

[R164] Hooke, R. (1675). A description of helioscopes and some other instruments (the inverted-catenary anagram: the funicular line of a pure arch). London. (Cited in source for the catenary intrados profile.)

H. Cyclopean masonry and recipe-driven assembly

[R72] Clifford, B., McGee, W. (2017/2018). Cyclopean cannibalism: a method for recycling rubble. ACADIA 2018, pp 404-413. Matter Design / MIT / U-Michigan / Quarra Stone Co.

[R73] Clifford, B., McGee, W. (2014). La Voute de LeFevre: a variable-volume compression-only vault. Fabricate 2014, pp 146-153.

[R74] Clifford, B. (2017). The cannibal's cookbook: mining myths of cyclopean constructions. Matter Publishing.

[R75] McGee, W., Durham, C., Zayas, J., Brugmann, S., Clifford, B. (2017). Quarra cairn. ACADIA 2018.

[R76] Ariza, I. et al. (2017). Robotic fabrication of stone assembly details. Fabricate 2017, Clemson CU-IMSE.

[R77] Protzen, J.-P. (1993). Inca architecture and construction at Ollantaytambo. Oxford University Press. ISBN 978-0195070699.

[R78] Hopkins, K., Beard, M. (2005). The Colosseum. Harvard University Press. ISBN 978-0674018952.

[R79] Hesiod. Theogony. Brown, N.O. (trans., 1953), Liberal Arts Press.

[R80] Quarra Stone Company (2025). "Out of Frame" lecture, MIT Architecture, 24 October 2025 (Marshall, Smith, Wen, Gwinn).

I. Geometry, mesh processing, and computational geometry

[R81] Botsch, M., Kobbelt, L., Pauly, M., Alliez, P., Levy, B. (2010). Polygon mesh processing. AK Peters / CRC Press. ISBN 978-1568814261.

[R82] Greiner, G., Hormann, K. (1998). Efficient clipping of arbitrary polygons. ACM Transactions on Graphics 17(2):71-83. DOI 10.1145/274363.274364.

[R83] Foster, E.L., Hormann, K. (2008). Clipping simple polygons with degenerate intersections. Computers & Graphics 32(2):71-83.

[R84] Barber, C.B., Dobkin, D.P., Huhdanpaa, H. (1996). The QuickHull algorithm for convex hulls. ACM Transactions on Mathematical Software 22(4):469-483. DOI 10.1145/235815.235821.

[R85] Akenine-Moller, T. (2001). Fast 3D triangle-box overlap testing. Journal of Graphics Tools 6(1):29-33. DOI 10.1080/10867651.2001.10487535.

[R86] Guigue, P., Devillers, O. (2003). Fast and robust triangle-triangle overlap test using orientation predicates. Journal of Graphics Tools 8(1):25-32. DOI 10.1080/10867651.2003.10487580.

[R87] Lloyd, S.P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory 28(2):129-137. DOI 10.1109/TIT.1982.1056489.

[R88] Edelsbrunner, H., Mucke, E.P. (1994). Three-dimensional alpha shapes. ACM Transactions on Graphics 13(1):43-72. DOI 10.1145/174462.156635.

[R89] Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., Stuetzle, W. (1992). Surface reconstruction from unorganized points. SIGGRAPH '92, Computer Graphics 26(2):71-78. DOI 10.1145/142920.134011.

[R90] Kazhdan, M., Bolitho, M., Hoppe, H. (2006). Poisson surface reconstruction. Eurographics Symposium on Geometry Processing, pp 61-70.

[R91] Kazhdan, M., Hoppe, H. (2013). Screened Poisson surface reconstruction. ACM Transactions on Graphics 32(3):29:1-29:13. DOI 10.1145/2487228.2487237.

[R92] Cohen-Steiner, D., Alliez, P., Desbrun, M. (2004). Variational shape approximation. ACM Transactions on Graphics (SIGGRAPH 2004) 23(3):905-914. DOI 10.1145/1015706.1015817.

[R93] Skrodzki, M., Zimmermann, J., Polthier, K. (2020). Variational shape approximation of point set surfaces. Computer Aided Geometric Design 80:101875.

[R94] Frey, P.J., Borouchaki, H. (1999). Surface mesh quality evaluation. International Journal for Numerical Methods in Engineering 45(1):101-118. DOI 10.1002/(SICI)1097-0207(19990510)45:1<101::AID-NME582>3.0.CO;2-4.

[R95] Crane, K., Weischedel, C., Wardetzky, M. (2013). Geodesics in heat: a new approach to computing distance based on heat flow. ACM Transactions on Graphics 32(5):152. DOI 10.1145/2516971.2516977.

[R96] Aichholzer, O., Aurenhammer, F. (1996). Straight skeletons for general polygonal figures in the plane. COCOON 1996, LNCS 1090, pp 117-126.

[R97] Lindstrom, P., Turk, G. (1998). Fast and memory efficient polygonal simplification (quadric edge-collapse). IEEE Visualization '98, pp 279-286.

[R98] Shapira, L., Shamir, A., Cohen-Or, D. (2008). Consistent mesh partitioning and skeletonisation using the shape diameter function. The Visual Computer 24(4):249-259. DOI 10.1007/s00371-007-0197-5.

[R165] Cooley, J.W., Tukey, J.W. (1965). An algorithm for the machine calculation of complex Fourier series. Mathematics of Computation 19(90):297-301. DOI 10.1090/S0025-5718-1965-0178586-1. (Radix-2 FFT for the in-tree GPR spectral kernel.)

J. Surface parameterisation and unwrapping

[R99] Sawhney, R., Crane, K. (2017). Boundary first flattening. ACM Transactions on Graphics 36(4):109. DOI 10.1145/3072959.3056432.

[R100] Floater, M.S. (2003). Mean value coordinates. Computer Aided Geometric Design 20(1):19-27. DOI 10.1016/S0167-8396(03)00002-5. (The mean-value-coordinate family. The shipped surface lift is plain triangle barycentric interpolation, not Floater's polygon MVC; this work is the attribution for the barycentric family, not the exact implemented scheme — see chapter 07.)

K. Registration, ICP, pose, and assignment

[R101] Besl, P.J., McKay, N.D. (1992). A method for registration of 3-D shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence 14(2):239-256. DOI 10.1109/34.121791.

[R102] Kabsch, W. (1976). A solution for the best rotation to relate two sets of vectors. Acta Crystallographica A32:922-923. DOI 10.1107/S0567739476001873.

[R103] Horn, B.K.P. (1987). Closed-form solution of absolute orientation using unit quaternions. Journal of the Optical Society of America A 4(4):629-642. DOI 10.1364/JOSAA.4.000629.

[R104] Myronenko, A., Song, X. (2010). Point set registration: coherent point drift. IEEE Transactions on Pattern Analysis and Machine Intelligence 32(12):2262-2275. DOI 10.1109/TPAMI.2010.46.

[R105] Hirose, O. (2021). A Bayesian formulation of coherent point drift. IEEE Transactions on Pattern Analysis and Machine Intelligence 43(7):2269-2286. DOI 10.1109/TPAMI.2020.2971687.

[R106] Fitzgibbon, A.W. (2001). Robust registration of 2D and 3D point sets. BMVC 2001.

[R107] Sola, J., Deray, J., Atchuthan, D. (2018). A micro Lie theory for state estimation in robotics. arXiv:1812.01537.

[R108] Kuhn, H.W. (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2(1-2):83-97. DOI 10.1002/nav.3800020109.

[R109] Munkres, J. (1957). Algorithms for the assignment and transportation problems. Journal of the SIAM 5(1):32-38. DOI 10.1137/0105003.

[R110] Welsh, D.J.A., Powell, M.B. (1967). An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal 10(1):85-86. DOI 10.1093/comjnl/10.1.85.

[R111] Graham, R.L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics 17(2):416-429. DOI 10.1137/0117039.

[R166] Bourgeois, F., Lassalle, J.-C. (1971). An extension of the Munkres algorithm for the assignment problem to rectangular matrices. Communications of the ACM 14(12):802-804. DOI 10.1145/362919.362945. (Shortest-augmenting-path Hungarian formulation cited in the HungarianAssignment header; the Kuhn 1955 [R108] / Munkres 1957 [R109] lineage is the textbook basis.)

L. Learning-based reassembly and fracture datasets

[R112] Wang, Z., Chen, B., Furukawa, Y. (2025). PuzzleFusion++: auto-agglomerative 3D fracture assembly by denoising and verification. ICLR 2025. arXiv:2406.00259.

[R113] Sellan, S., Chen, Y.-C., Wu, Z., Garg, A., Jacobson, A. (2022). Breaking bad: a dataset for geometric fracture and reassembly. NeurIPS 2022 Datasets and Benchmarks.

[R114] ETH dry-stone masonry dataset (ETH1100): 1100 real meshes with viability labels. Zenodo record 10038881.

[R167] Ho, J., Jain, A., Abbeel, P. (2020). Denoising diffusion probabilistic models. Advances in Neural Information Processing Systems 33:6840-6851. arXiv:2006.11239.

[R168] Qi, C.R., Yi, L., Su, H., Guibas, L.J. (2017). PointNet++: deep hierarchical feature learning on point sets in a metric space. Advances in Neural Information Processing Systems 30. arXiv:1706.02413.

[R169] van den Oord, A., Vinyals, O., Kavukcuoglu, K. (2017). Neural discrete representation learning (VQ-VAE). Advances in Neural Information Processing Systems 30. arXiv:1711.00937.

[R170] Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., Polosukhin, I. (2017). Attention is all you need. Advances in Neural Information Processing Systems 30. arXiv:1706.03762.

[R171] Peebles, W., Xie, S. (2023). Scalable diffusion models with transformers (DiT, adaptive layer-norm conditioning). IEEE/CVF ICCV 2023:4195-4205. arXiv:2212.09748.

M. Matching and circular reuse

[R115] Tomczak, A., Haakonsen, S.M., Luczkowski, M. (2023). Matching algorithms to assist in designing with reclaimed building elements. Environmental Research: Infrastructure and Sustainability 3(3):035005. DOI 10.1088/2634-4505/acf341. CC-BY 4.0.

[R116] Haakonsen, S.M., Tomczak, A., Izumi, B., Luczkowski, M. (2024). Automation of circular design: a timber building case study. International Journal of Architectural Computing. DOI 10.1177/14780771241234447.

[R117] Tomczak, A., Haakonsen, S.M., Luczkowski, M. structuralCircle (MIT). Zenodo DOI 10.5281/zenodo.7396796.

[R118] Deb, K., Pratap, A., Agarwal, S., Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2):182-197. DOI 10.1109/4235.996017.

N. Statistics, uncertainty, and value of information

[R119] Cressie, N.A.C. (1993). Statistics for spatial data. Wiley. DOI 10.1002/9781119115151.

[R120] Rasmussen, C.E., Williams, C.K.I. (2006). Gaussian processes for machine learning. MIT Press. DOI 10.7551/mitpress/3206.001.0001.

[R121] Eidsvik, J., Mukerji, T., Bhattacharjya, D. (2015). Value of information in the earth sciences. Cambridge University Press. DOI 10.1017/CBO9781139628785.

[R122] JCGM (2008). JCGM 100:2008 — evaluation of measurement data: guide to the expression of uncertainty in measurement (GUM). Joint Committee for Guides in Metrology, BIPM.

[R123] Tukey, J.W. (1977). Exploratory data analysis. Addison-Wesley. ISBN 978-0201076165.

[R172] Shepard, D. (1968). A two-dimensional interpolation function for irregularly-spaced data. Proceedings of the 23rd ACM National Conference, pp 517-524. DOI 10.1145/800186.810616. (Inverse-distance weighting for the bedrock TIN merge.)

O. Software, libraries, formats, and tools

[R124] Levy, B. (INRIA/ALICE). Geogram: a programming library of geometric algorithms (v1.9.9). BSD-3. https://github.com/BrunoLevy/geogram.

[R125] The CGAL Project (2023). CGAL user and reference manual. CGAL Editorial Board. GPLv3 / commercial. https://www.cgal.org.

[R126] Johnson, A. Clipper2: a polygon clipping and offsetting library (Vatti-derived). Boost Software License 1.0. https://github.com/AngusJohnson/Clipper2.

[R127] Ruegg, C. et al. Math.NET Numerics (v4.15.x, last net48-compatible). MIT. https://numerics.mathdotnet.com.

[R128] Google. OR-Tools optimisation library. Apache 2.0. https://developers.google.com/optimization.

[R129] Piker, D. Kangaroo 2: goal-based dynamic relaxation physics solver for Grasshopper. https://www.grasshopper3d.com/group/kangaroo.

[R130] Robert McNeel & Associates (2023). Rhinoceros 3D, version 8 [computer software]. Seattle, WA. https://www.rhino3d.com.

[R131] Vierlinger, R. Octopus: SPEA-2 + HypE multi-objective optimisation plug-in for Grasshopper. https://www.food4rhino.com/app/octopus.

[R132] Varela, P.A.A., Sousa, J.P. Voussoir: stereotomy plug-in for Grasshopper. FAUP Porto Digital Fabrication Laboratory, FCT-funded STBIM project. https://www.food4rhino.com/en/app/voussoir.

[R133] PolytopeSolutions. GrasshopperTools — MatchMeshTransformation component (GUID 4C8CE3F5-67AA-4E08-A14F-894F026E3D66).

[R134] Holzmann, G.J. (2006). The power of ten — rules for developing safety-critical code. NASA/JPL Laboratory for Reliable Software. IEEE Computer 39(6):95-99. DOI 10.1109/MC.2006.212.

[R135] Isenburg, M. (2013). LASzip: lossless compression of LiDAR data. Photogrammetric Engineering & Remote Sensing 79(2):209-217. DOI 10.14358/PERS.79.2.209.

[R136] Turk, G. (1994). The PLY polygon file format. Stanford University Graphics Laboratory.

[R137] ASTM E2807-11 (2011, reapproved). Standard specification for 3D imaging data exchange, version 1.0 (E57 format).

[R138] ASPRS. LAS specification version 1.4-R15. American Society for Photogrammetry and Remote Sensing.

[R139] NetTopologySuite.IO.Esri. ESRI Shapefile and GeoJSON readers implementing OGC Simple Features. https://github.com/NetTopologySuite.

[R140] SEG Technical Standards Committee. SEG-Y data exchange format, revisions 0/1/2. Society of Exploration Geophysicists.

[R173] Coumans, E. et al. Bullet Physics SDK: rigid-body dynamics with a sequential-impulse solver (via BulletSharp.x64). zlib License. https://github.com/bulletphysics/bullet3.

[R174] Wallace, E. csg.js: constructive solid geometry via BSP trees. MIT. (Ported as the managed MeshCsg boolean fallback.)

[R175] ISO 6983-1:2009. Automation systems and integration — numerical control of machines — program format and definitions of address words — part 1: data format for positioning, line motion and contouring control systems. International Organization for Standardization. (G-code ingest.)

[R176] Bowring, B.R. (1976). Transformation from spatial to geographical coordinates. Survey Review 23(181):323-327. DOI 10.1179/sre.1976.23.181.323.

[R177] Karney, C.F.F. (2011). Transverse Mercator with an accuracy of a few nanometres. Journal of Geodesy 85(8):475-485. DOI 10.1007/s00190-011-0445-3.

[R178] Snyder, J.P. (1987). Map projections: a working manual. USGS Professional Paper 1395.

[R179] Braumann, J., Brell-Cokcan, S. KUKA|prc — parametric robot control for Grasshopper. Association for Robots in Architecture, Vienna. https://www.robotsinarchitecture.org/kukaprc.

[R180] Soler, V. Robots — a plugin for programming industrial robots in Grasshopper (MIT). https://github.com/visose/Robots.

P. Industrial and craft precedents

[R141] Gaudi, A. Trencadis (broken-tile mosaic), Park Guell, Barcelona (craft precedent for fragment packing).

[R181] Zhang, Y., Wu, H., Wang, J. et al. (2024). Robotic diamond-wire cutting of stone with a six-axis arm and end-effector wire saw. Journal of Computational Design and Engineering 11(6):75-85. DOI 10.1093/jcde/qwae094. (Robot-mounted diamond-wire kerf-compensation precedent; distinct from the block-cutting MATLAB toolbox Zhang et al. 2024 [R145].)

[R182] Moult, S., Weir, J., Fernando, S. (2018). Robotic diamond-wire bandsaw cutting of stone with a portable end-effector. University of Sydney (proceedings reference, cited in source).

Q. Additional cited works (chapter binding sections)

[R142] Minetto, R., Volpato, N., Stolfi, J., Gregori, R.M.M.H., da Silva, M.V.G. (2017). An optimal algorithm for 3D triangle mesh slicing. Computer-Aided Design 92:1-10. DOI 10.1016/j.cad.2017.07.001.

[R143] Battiato, S., Di Blasi, G., Gallo, G., Guarnera, G.C., Puglisi, G. (2013). Artificial mosaic generation: a survey and synthesis (Trencadis synthesis precedent, cited in source).

[R144] Murugean, L. (2026). GPR-to-block-yield optimization for fractured dimension-stone quarries (submitted, Bulletin of Engineering Geology and the Environment; reproducibility deposit). DOI 10.5281/zenodo.20608279.

[R145] Zhang, N., Zheng, H., Yang, M., Wang, N. (2024). An open-source MATLAB toolbox for 3D block cutting and 3D mesh cutting in geotechnical engineering. Advances in Engineering Software 197:103762. DOI 10.1016/j.advengsoft.2024.103762.

[R146] Stolt, R.H. (1978). Migration by Fourier transform. Geophysics 43(1):23-48. DOI 10.1190/1.1440826.

[R147] Taner, M.T., Koehler, F., Sheriff, R.E. (1979). Complex seismic trace analysis. Geophysics 44(6):1041-1063. DOI 10.1190/1.1440994.

R. Masonry-CRA and edge-matching binding-section additions

[R153] Stellato, B., Banjac, G., Goulart, P., Bemporad, A., Boyd, S. (2020). OSQP: an operator splitting solver for quadratic programs. Mathematical Programming Computation 12:637-672. DOI 10.1007/s12532-020-00179-2. (ADMM-QP basis for AdmmQpSolver.)

[R154] Legakis, J., Dorsey, J., Gortler, S. (2001). Feature-based cellular texturing for architectural models. SIGGRAPH 2001, pp 309-316. DOI 10.1145/383259.383293. (Closest known prior for cellular wall texturing; A-candidate sweep reference for the Polygonal Wall generator.)

[R155] Arkin, E.M., Chew, L.P., Huttenlocher, D.P., Kedem, K., Mitchell, J.S.B. (1991). An efficiently computable metric for comparing polygonal shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence 13(3):209-216. DOI 10.1109/34.75509. (Turning-function shape metric; boundary segmenter signature basis.)

[R156] Marcotte, O., Suri, S. (1991). Fast matching algorithms for points on a polygon. SIAM Journal on Computing 20(3):405-422. DOI 10.1137/0220025. (Order-preserving boundary correspondence basis.)

[R157] Umeyama, S. (1991). Least-squares estimation of transformation parameters between two point patterns. IEEE Transactions on Pattern Analysis and Machine Intelligence 13(4):376-380. DOI 10.1109/34.88573. (Closed-form similarity / rigid fit; absolute-orientation kernel companion to Kabsch [R102] and Horn [R103].)

[R158] Bruetting, J., Desruelle, J., Senatore, G., Fivet, C. (2019). Design of truss structures through reuse. Structures 18:128-137. DOI 10.1016/j.istruc.2018.11.006. (Inventory-constrained reuse design; precedent for stone-inventory-to-cell assignment.)

[R159] Bukauskas, A., Shepherd, P., Walker, P., Sharma, B., Bregulla, J. (2019). Inventory-constrained structural design: new objectives and optimization techniques. (Reclaimed-element matching precedent.)

Sources and provenance

  • Code attributes: 262 [Algorithm(...)] occurrences across 138 files in src/; distinct cited works extracted and matched to entries above. The in-repo command FrahanWhichAlgorithm prints these citations per component. Entries tagged Frahan-original in the code (e.g. the 5-stage edge-matching pipeline, the BlockCutOpt v2 synthesis, the Kintsugi pose-composition fix, the conformal chart-scale recovery) are original research documented in wiki/algorithms/ and wiki/specs/; they are not third-party works and so carry no external citation here.
  • Curated library: wiki/index/references.md (~70 keyed entries, authored 2026-05-31).
  • Paper bibliographies: MASTER_PAPER.tex and MASTER_PAPER_BoEGE.tex (BoEGE submission, 2026-06-09).

Normalisation notes for the binding pass.

  • The Kim DETC2024-142563 paper is keyed once at [R59] under the correct first-author initial (Kim, T.), deduplicated from the former duplicate S./T. entries. The Kim, T. (2025) Computation tree-packing paper is a distinct work, kept at [R9].
  • Jalalian is normalised to "Jalalian, M.H." at [R23] for every BCSdbBV citation.
  • The Floater 2003 [R100] credit on the barycentric surface lift is an attribution to the mean-value-coordinate family, not a claim that the shipped code implements Floater's polygon MVC; the implemented method is classical triangle barycentric interpolation (chapter 07).
  • The Best-Fit inventory lineage is Furrer 2017 [R61] / Johns 2020 [R62], not the Gramazio/Kohler/Eichenhofer 2017 reference [R60]; the previously mislabelled attribute is corrected to Furrer/Johns (flag E5).
  • The edge-matching coarse-lag stage [R155] turning-function basis is a direct cross-correlation, not a phase-correlation FFT; the wording is corrected in chapter 08 and the licensing register.

Several arXiv/DOI strings appear verbatim in [Algorithm(..., Doi=...)] attributes; where the attribute carried a partial venue, the full citation above was completed from the curated library and the paper bibliographies.