References#
Tomas Akenine-Möller. Fast 3D triangle-box overlap testing. ACM SIGGRAPH 2005 Courses, SIGGRAPH 2005, 2005. URL: https://www.doi.org/10.1145/1198555.1198747, doi:10.1145/1198555.1198747.
Romain Aubry and Rainald Löhner. On the 'most normal' normal. Communications in Numerical Methods in Engineering, 24(12):1641–1652, dec 2008. URL: https://onlinelibrary.wiley.com/doi/full/10.1002/cnm.1056 https://onlinelibrary.wiley.com/doi/abs/10.1002/cnm.1056 https://onlinelibrary.wiley.com/doi/10.1002/cnm.1056, doi:10.1002/cnm.1056.
Frederic J. Blom. Considerations on the spring analogy. International Journal for Numerical Methods in Fluids, 32(6):647–668, 2000. URL: https://doi.org/10.1002/(SICI)1097-0363(20000330)32:6{\%}3C647::AID-FLD979{\%}3E3.0.CO;2-K, doi:10.1002/(SICI)1097-0363(20000330)32:6<647::AID-FLD979>3.0.CO;2-K.
Jules Bloomenthal. An Implicit Surface Polygonizer. Graphics Gems, pages 324–349, 1994. doi:10.1016/b978-0-12-336156-1.50040-9.
C. L. Bottasso and D. Detomi. A procedure for tetrahedral boundary layer mesh generation. Engineering with Computers, 18(1):66–79, 2002. doi:10.1007/s003660200006.
Adrian Bowyer. Computing Dirichlet Tessellations. Computer Journal, 24(2):162–166, 1981. URL: https://academic.oup.com/comjnl/article/24/2/162/338193, doi:10.1093/comjnl/24.2.162.
Ev Chernyaev. Marching cubes 33: Construction of topologically correct isosurfaces. Institute for High Energy Physics, Moscow, Russia,, pages 1–8, 1995.
Noura Faraj, Jean Marc Thiery, and Tamy Boubekeur. Multi-material adaptive volume remesher. Computers and Graphics (Pergamon), 58:150–160, 2016. URL: http://dx.doi.org/10.1016/j.cag.2016.05.019, doi:10.1016/j.cag.2016.05.019.
Lori A. Freitag. On combining laplacian and optimization-based mesh smoothing techniques. American Society of Mechanical Engineers, Applied Mechanics Division, AMD, 220:37–43, 1997.
Jack Goldfeather and Victoria Interrante. A novel cubic-order algorithm for approximating principal direction vectors. ACM Transactions on Graphics, 23(1):45–63, 2004. doi:10.1145/966131.966134.
Ron Goldman. Curvature formulas for implicit curves and surfaces. Computer Aided Geometric Design, 22(7 SPEC. ISS.):632–658, 2005. doi:10.1016/j.cagd.2005.06.005.
Elias Holmlid. Manifold Contouring of an Adaptively Sampled Distance Field. Chalmers Publication Library, pages 37, 2010. URL: http://publications.lib.chalmers.se/records/fulltext/123811.pdf.
Kai Hormann and Alexander Agathos. The point in polygon problem for arbitrary polygons. Computational Geometry: Theory and Applications, 20(3):131–144, 2001. URL: https://www.doi.org/10.1016/S0925-7721(01)00012-8, doi:10.1016/S0925-7721(01)00012-8.
Yixin Hu, Teseo Schneider, Bolun Wang, Denis Zorin, and Daniele Panozzo. Fast tetrahedral meshing in the wild. ACM Transactions on Graphics, 39(4):18, 2020. URL: https://www.doi.org/10.1145/3386569.3392385, arXiv:1908.03581, doi:10.1145/3386569.3392385.
Yixin Hu, Qingnan Zhou, Xifeng Gao, Alec Jacobson, Denis Zorin, and Daniele Panozzo. Tetrahedral meshing in the wild. ACM Transactions on Graphics, 2018. doi:10.1145/3197517.3201353.
Timothy O. Josephson and Elise F. Morgan. Mechanobiological optimization of scaffolds for bone tissue engineering. Biomechanics and Modeling in Mechanobiology, pages 1–18, jul 2024. URL: https://link.springer.com/article/10.1007/s10237-024-01880-0, doi:10.1007/S10237-024-01880-0.
Jan J. Koenderink and Andrea J. van Doorn. Surface shape and curvature scales. Image and Vision Computing, 10(8):557–564, 1992. URL: https://www.doi.org/10.1016/0262-8856(92)90076-F, doi:10.1016/0262-8856(92)90076-F.
David H. Laidlaw, W. Benjamin Trumbore, and John F. Hughes. Constructive solid geometry for polyhedral objects. Proceedings of the 13th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1986, pages 161–170, aug 1986. URL: https://www.doi.org/10.1145/15922.15904, doi:10.1145/15922.15904.
William E. Lorensen and Harvey E. Cline. Marching cubes: A high resolution 3D surface construction algorithm. Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1987, 21(4):163–169, 1987. doi:10.1145/37401.37422.
Tomas Möller. Fast triangle-triangle intersection test. Journal of Graphics Tools, 2(2):25–30, 1997. URL: https://www.doi.org/10.1080/10867651.1997.10487472, doi:10.1080/10867651.1997.10487472.
Tomas Möller and Ben Trumbore. Fast, minimum storage ray/triangle intersection. ACM SIGGRAPH 2005 Courses, SIGGRAPH 2005, pages 7823–7830, 2005. URL: https://www.doi.org/10.1145/1198555.1198746, doi:10.1145/1198555.1198746.
Y. Ohtake and A. G. Belyaev. Mesh optimization for polygonized isosurfaces. Computer Graphics Forum, 20(3):368–376, sep 2001. URL: https://onlinelibrary-wiley-com.ezproxy.bu.edu/doi/10.1111/1467-8659.00529, doi:10.1111/1467-8659.00529.
Yutaka Ohtake, Alexander Belyaev, and Alexander Pasko. Dynamic mesh optimization for polygonized implicit surfaces with sharp features. Visual Computer, 19(2-3):115–126, 2003. doi:10.1007/s00371-002-0181-z.
Scott Schaefer and Joe Warren. Dual marching cubes: Primal contouring of dual grids. Computer Graphics Forum, 24(2):195–201, 2005. doi:10.1111/j.1467-8659.2005.00843.x.
Jonathan Richard Shewchuk. Triangle: Engineering a 2D quality mesh generator and delaunay triangulator. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1148:203–222, 1996. URL: http://www.cs.cmu.edu/quake/triangle.html, doi:10.1007/bfb0014497.
Hang Si. TetGen, a delaunay-based quality tetrahedral mesh generator. ACM Transactions on Mathematical Software, feb 2015. URL: http://dx.doi.org/10.1145/2629697 https://dl.acm.org/doi/10.1145/2629697, doi:10.1145/2629697.
Grit Thürrner and Charles A. Wüthrich. Computing Vertex Normals from Polygonal Facets. Journal of Graphics Tools, 3(1):43–46, jan 1998. URL: https://www.tandfonline.com/doi/abs/10.1080/10867651.1998.10487487, doi:10.1080/10867651.1998.10487487.
Dimitris Vartziotis, Joachim Wipper, and Bernd Schwald. The geometric element transformation method for tetrahedral mesh smoothing. Computer Methods in Applied Mechanics and Engineering, 199(1-4):169–182, 2009. URL: http://www.twt-gmbh.de, doi:10.1016/j.cma.2009.09.027.
H. G. von Schnering and R. Nesper. Nodal surfaces of Fourier series: Fundamental invariants of structured matter. Zeitschrift für Physik B Condensed Matter, 83(3):407–412, 1991. URL: https://www.doi.org/10.1007/BF01313411, doi:10.1007/BF01313411.
David F. Watson. Computing the n-dimensional Delaunau tessellation with application to Voronoi polytopes. Computer Journal, 24(2):167–172, 1981. URL: https://academic.oup.com/comjnl/article/24/2/167/338200, doi:10.1093/comjnl/24.2.167.
Amy Williams, Steve Barrus, R. Keith Morley, and Peter Shirley. An efficient and robust ray-box intersection algorithm. ACM SIGGRAPH 2005 Courses, SIGGRAPH 2005, 10(1):55–60, 2005. URL: https://www.doi.org/10.1145/1198555.1198748, doi:10.1145/1198555.1198748.
Yongjie Zhang, Chandrajit Bajaj, and Bong Soo Sohn. Adaptive and quality 3D meshing from imaging data. Proceedings of the Symposium on Solid Modeling and Applications, pages 286–291, 2003. doi:10.1145/781606.781653.