Fast tetrahedral meshing in the wild
暂无分享,去创建一个
Daniele Panozzo | Denis Zorin | Teseo Schneider | Bolun Wang | Yixin Hu | D. Zorin | Daniele Panozzo | T. Schneider | Bolun Wang | Yixin Hu
[1] Ryan Schmidt,et al. meshmixer: an interface for rapid mesh composition , 2010, SIGGRAPH '10.
[2] Frédéric Alauzet,et al. A Closed Advancing-Layer Method with Changing Topology Mesh Movement for Viscous Mesh Generation , 2013, IMR.
[3] Jean-Christophe Cuillière,et al. Automatic 3D Mesh Generation of Multiple Domains for Topology Optimization Methods , 2012, IMR.
[4] Joshua A. Levine,et al. Delpsc: a delaunay mesher for piecewise smooth complexes , 2008, SCG '08.
[5] E BreenDavid,et al. Level set surface editing operators , 2002 .
[6] Jonathan Richard Shewchuk,et al. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.
[7] Steve Oudot,et al. Provably good sampling and meshing of surfaces , 2005, Graph. Model..
[8] Olga Sorkine-Hornung,et al. Scalable locally injective mappings , 2017, TOGS.
[9] Bruce F. Naylor,et al. Set operations on polyhedra using binary space partitioning trees , 1987, SIGGRAPH.
[10] Kenshi Takayama,et al. A Simple Method for Correcting Facet Orientations in Polygon Meshes Based on Ray Casting , 2014 .
[11] Mariette Yvinec,et al. Conforming Delaunay triangulations in 3D , 2002, SCG '02.
[12] J. A. George. Computer implementation of the finite element method , 1971 .
[13] Daniele Panozzo,et al. Tetrahedral meshing in the wild , 2018, ACM Trans. Graph..
[14] Jonathan Richard Shewchuk,et al. Aggressive Tetrahedral Mesh Improvement , 2007, IMR.
[15] Marco Attene,et al. On converting sets of tetrahedra to combinatorial and PL manifolds , 2009, Comput. Aided Geom. Des..
[16] Tamal K. Dey,et al. Delaunay Mesh Generation , 2012, Chapman and Hall / CRC computer and information science series.
[17] Dinesh Manocha,et al. Topology preserving surface extraction using adaptive subdivision , 2004, SGP '04.
[18] Marco Attene,et al. ImatiSTL - Fast and Reliable Mesh Processing with a Hybrid Kernel , 2017, Trans. Comput. Sci..
[19] Olga Sorkine-Hornung,et al. Robust inside-outside segmentation using generalized winding numbers , 2013, ACM Trans. Graph..
[20] Baining Guo,et al. Computing locally injective mappings by advanced MIPS , 2015, ACM Trans. Graph..
[21] Vadim Shapiro,et al. Regularized arrangements of cellular complexes , 2017, 1704.00142.
[22] Lizhuang Ma,et al. Efficient non-incremental constructive solid geometry evaluation for triangular meshes , 2018, Graph. Model..
[23] Marcel Campen,et al. Hybrid Booleans , 2010, Comput. Graph. Forum.
[24] E LorensenWilliam,et al. Marching cubes: A high resolution 3D surface construction algorithm , 1987 .
[25] Jonathan Richard Shewchuk,et al. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..
[26] Simon R. Arridge,et al. Basis mapping methods for forward and inverse problems , 2017 .
[27] Matthijs Douze,et al. QuickCSG: Arbitrary and Faster Boolean Combinations of N Solids , 2015 .
[28] Mariette Yvinec,et al. Variational tetrahedral meshing , 2005, ACM Trans. Graph..
[29] Joshua A. Levine,et al. Repairing and meshing imperfect shapes with Delaunay refinement , 2009, Symposium on Solid and Physical Modeling.
[30] Christopher J. Bishop,et al. Nonobtuse Triangulations of PSLGs , 2016, Discret. Comput. Geom..
[31] Jonathan Richard Shewchuk,et al. What is a Good Linear Element? Interpolation, Conditioning, and Quality Measures , 2002, IMR.
[32] Alec Jacobson,et al. Fast winding numbers for soups and clouds , 2018, ACM Trans. Graph..
[33] LongChen,et al. OPTIMAL DELAUNAY TRIANGULATIONS , 2004 .
[34] N. Weatherill,et al. Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints , 1994 .
[35] Sebti Foufou,et al. Exact, robust, and efficient regularized Booleans on general 3D meshes , 2015, Comput. Math. Appl..
[36] David M. Mount,et al. A point-placement strategy for conforming Delaunay tetrahedralization , 2000, SODA '00.
[37] Robert Bridson,et al. Isosurface stuffing improved: acute lattices and feature matching , 2013, SIGGRAPH '13.
[38] Pierre Alliez,et al. Isotopic approximation within a tolerance volume , 2015, ACM Trans. Graph..
[39] Marcel Campen,et al. Exact and Robust (Self‐)Intersections for Polygonal Meshes , 2010, Comput. Graph. Forum.
[40] S. Canann,et al. Optismoothing: an optimization-driven approach to mesh smoothing , 1993 .
[41] Jonathan Richard Shewchuk,et al. Isosurface stuffing: fast tetrahedral meshes with good dihedral angles , 2007, ACM Trans. Graph..
[42] Daniele Panozzo,et al. TriWild: robust triangulation with curve constraints , 2019, ACM Trans. Graph..
[43] Daniele Panozzo,et al. Decoupling simulation accuracy from mesh quality , 2018, ACM Trans. Graph..
[44] Desheng Wang,et al. Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations , 2003 .
[45] Hanspeter Bieri,et al. Elementary Set Operations with d-Dimensional Polyhedra , 1988, Workshop on Computational Geometry.
[46] L. Paul Chew,et al. Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.
[47] P. George,et al. ‘Ultimate’ robustness in meshing an arbitrary polyhedron , 2003 .
[48] Mariette Yvinec,et al. CGALmesh , 2015, ACM Trans. Math. Softw..
[49] Marco Attene,et al. Exact and efficient polyhedral envelope containment check , 2020, ACM Trans. Graph..
[50] Jonathan Richard Shewchuk,et al. Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery , 2002, IMR.
[51] Carl Ollivier-Gooch,et al. Tetrahedral mesh improvement using swapping and smoothing , 1997 .
[52] Jonathan Richard Shewchuk,et al. Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.
[53] Klaus Gärtner,et al. Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations , 2005, IMR.
[54] O. C. Zienkiewicz,et al. Adaptive remeshing for compressible flow computations , 1987 .
[55] Charlie C. L. Wang. Approximate Boolean Operations on Large Polyhedral Solids with Partial Mesh Reconstruction , 2011, IEEE Transactions on Visualization and Computer Graphics.
[56] Robert Haimes,et al. MOSS: multiple orthogonal strand system , 2014, Engineering with Computers.
[57] Steven Fortune,et al. Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[58] Olivier Devillers,et al. Fast and Robust Triangle-Triangle Overlap Test Using Orientation Predicates , 2003, J. Graphics, GPU, & Game Tools.
[59] Jonathan Richard Shewchuk,et al. Unstructured Mesh Generation , 2011 .
[60] Yaron Lipman,et al. Bounded distortion mapping spaces for triangular meshes , 2012, ACM Trans. Graph..
[61] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[62] Eitan Grinspun,et al. Mesh arrangements for solid geometry , 2016, ACM Trans. Graph..
[63] Lizhuang Ma,et al. Accelerated robust Boolean operations based on hybrid representations , 2018, Comput. Aided Geom. Des..
[64] William E. Lorensen,et al. Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.
[65] Kurt Mehlhorn,et al. Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation , 2003, ESA.
[66] Jonathan Richard Shewchuk,et al. Lecture Notes on Delaunay Mesh Generation , 2012 .
[67] Jonathan Richard Shewchuk,et al. Incrementally constructing and updating constrained Delaunay tetrahedralizations with finite-precision coordinates , 2013, Engineering with Computers.
[68] M. Yvinec,et al. Variational tetrahedral meshing , 2005, SIGGRAPH 2005.
[69] Alec Jacobson,et al. Thingi10K: A Dataset of 10, 000 3D-Printing Models , 2016, ArXiv.
[70] Pierre Alliez,et al. Error-Bounded and Feature Preserving Surface Remeshing with Minimal Angle Improvement , 2017, IEEE Transactions on Visualization and Computer Graphics.
[71] Hang Si,et al. TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator , 2015, ACM Trans. Math. Softw..
[72] Gilbert Bernstein,et al. Fast, Exact, Linear Booleans , 2009, Comput. Graph. Forum.
[73] Akio Koide,et al. An Efficient Method of Triangulating Equi-Valued Surfaces by Using Tetrahedral Cells , 1991 .
[74] Marco Attene. Direct repair of self-intersecting meshes , 2014, Graph. Model..
[75] John Amanatides,et al. Merging BSP trees yields polyhedral set operations , 1990, SIGGRAPH.
[76] Salles V. G. Magalhães,et al. Fast exact parallel 3D mesh intersection algorithm using only orientation predicates , 2017, SIGSPATIAL/GIS.
[77] David E. Breen,et al. Level set surface editing operators , 2002, ACM Trans. Graph..
[78] Marc Alexa,et al. Harmonic triangulations , 2019, ACM Trans. Graph..
[79] Hervé Delingette,et al. Curved optimal delaunay triangulation , 2018, ACM Trans. Graph..
[80] David Eppstein,et al. Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[81] Tamy Boubekeur,et al. Multi-material adaptive volume remesher , 2016, Comput. Graph..
[82] Marco Attene,et al. A lightweight approach to repairing digitized polygon meshes , 2010, The Visual Computer.
[83] Charlie C. L. Wang,et al. Parallel and efficient Boolean on polygonal solids , 2011, The Visual Computer.
[84] Edward A. Sadek,et al. A scheme for the automatic generation of triangular finite elements , 1980 .
[85] Jean-François Remacle. A two-level multithreaded Delaunay kernel , 2017, Comput. Aided Des..
[86] Joshua A. Levine,et al. A Practical Delaunay Meshing Algorithm for aLarge Class of Domains* , 2007, IMR.
[87] Pierre Alliez,et al. Interleaving Delaunay refinement and optimization for practical isotropic tetrahedron mesh generation , 2009, ACM Trans. Graph..
[88] Don Sheehy. New Bounds on the Size of Optimal Meshes , 2012, Comput. Graph. Forum.
[89] Marco Attene,et al. Polygon mesh repairing: An application perspective , 2013, CSUR.
[90] Ross T. Whitaker,et al. Lattice Cleaving: Conforming Tetrahedral Meshes of Multimaterial Domains with Bounded Quality , 2012, IMR.
[91] Vadim Shapiro,et al. Arrangements of cellular complexes , 2017, ArXiv.
[92] Ronald Fedkiw,et al. Tetrahedral Mesh Generation for Deformable Bodies , 2003 .
[93] James F. O'Brien,et al. Interpolating and approximating implicit surfaces from polygon soup , 2004, SIGGRAPH Courses.
[94] Jim Ruppert,et al. A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.
[95] L. Paul Chew,et al. Constrained Delaunay triangulations , 1987, SCG '87.
[96] Mariette Yvinec,et al. Triangulations in CGAL , 2002, Comput. Geom..
[97] S. N. Muthukrishnan,et al. Topological refinement procedures for triangular finite element meshes , 1996, Engineering with Computers.
[98] Mark Yerry,et al. A Modified Quadtree Approach To Finite Element Mesh Generation , 1983, IEEE Computer Graphics and Applications.
[99] Brenda S. Baker,et al. Nonobtuse triangulation of polygons , 1988, Discret. Comput. Geom..
[100] Masoud Akbarzadeh,et al. 3D Graphical Statics Using Reciprocal Polyhedral Diagrams , 2016 .