Exact and efficient polyhedral envelope containment check
暂无分享,去创建一个
[1] Jarek Rossignac,et al. Solid-interpolating deformations: Construction and animation of PIPs , 1991, Comput. Graph..
[2] Houman Borouchaki,et al. Surface meshing using a geometric error estimate , 2003 .
[3] Pierre Alliez,et al. Error-Bounded and Feature Preserving Surface Remeshing with Minimal Angle Improvement , 2017, IEEE Transactions on Visualization and Computer Graphics.
[4] Jean-Michel Muller,et al. Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions , 2016, IEEE Transactions on Computers.
[5] J. Cameron. Number as Types , 2000 .
[6] Gilbert Bernstein,et al. Fast, Exact, Linear Booleans , 2009, Comput. Graph. Forum.
[7] Pierre Alliez,et al. Isotopic approximation within a tolerance volume , 2015, ACM Trans. Graph..
[8] Hugues Hoppe,et al. Progressive meshes , 1996, SIGGRAPH.
[9] Sandeep Koranne,et al. Boost C++ Libraries , 2011 .
[10] Chee-Keng Yap,et al. Recent progress in exact geometric computation , 2005, J. Log. Algebraic Methods Program..
[11] Marcel Campen,et al. Exact and Robust (Self‐)Intersections for Polygonal Meshes , 2010, Comput. Graph. Forum.
[12] Gershon Elber,et al. Precise Hausdorff distance computation between polygonal meshes , 2010, Comput. Aided Geom. Des..
[13] Peter Hachenberger,et al. Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces , 2007, Algorithmica.
[14] Daniele Panozzo,et al. Tetrahedral meshing in the wild , 2018, ACM Trans. Graph..
[15] Jon G. Rokne. Interval Arithmetic , 1992, Graphics Gems III.
[16] Marcel Campen,et al. Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes , 2010, Comput. Graph. Forum.
[17] Olivier Devillers,et al. Efficient Exact Geometric Predicates for Delauny Triangulations , 2003, ALENEX.
[18] Pijush K. Ghosh,et al. A unified computational framework for Minkowski operations , 1993, Comput. Graph..
[19] Young J. Kim,et al. Interactive Hausdorff distance computation for general polygonal models , 2009, SIGGRAPH '09.
[20] Mikhail J. Atallah,et al. A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons , 1983, Inf. Process. Lett..
[21] Michael Garland,et al. Surface simplification using quadric error metrics , 1997, SIGGRAPH.
[22] Daniel J. Duffy. The Boost C++ Libraries: Part II , 2011 .
[23] Hayong Shin,et al. Self-intersection Removal in Triangular Mesh Offsetting , 2003 .
[24] Dinesh Manocha,et al. Simplification envelopes , 1996, SIGGRAPH.
[25] Sylvain Pion,et al. Interval arithmetic yields efficient dynamic filters for computational geometry , 1998, SCG '98.
[26] H. Borouchaki,et al. Simplification of surface mesh using Hausdorff envelope , 2005 .
[27] Daniele Panozzo,et al. Fast tetrahedral meshing in the wild , 2019, ACM Trans. Graph..
[28] Vincent Lefèvre,et al. MPFR: A multiple-precision binary floating-point library with correct rounding , 2007, TOMS.
[29] Christopher J. Van Wyk,et al. Static analysis yields efficient exact integer arithmetic for computational geometry , 1996, TOGS.
[30] Sylvain Pion,et al. FPG: A code generator for fast and certified geometric predicates , 2008 .
[31] Chi Zhang,et al. Practical error-bounded remeshing by adaptive refinement , 2019, Comput. Graph..
[32] Jonathan Richard Shewchuk,et al. Incrementally constructing and updating constrained Delaunay tetrahedralizations with finite-precision coordinates , 2013, Engineering with Computers.
[33] Alec Jacobson,et al. Thingi10K: A Dataset of 10, 000 3D-Printing Models , 2016, ArXiv.
[34] Sylvain Pion,et al. A generic lazy evaluation scheme for exact geometric computations , 2006, Sci. Comput. Program..
[35] Jonathan Richard Shewchuk,et al. Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..
[36] Baining Guo,et al. Anisotropic simplicial meshing using local convex functions , 2014, ACM Trans. Graph..
[37] Paolo Cignoni,et al. Metro: Measuring Error on Simplified Surfaces , 1998, Comput. Graph. Forum.
[38] Daniele Panozzo,et al. TriWild , 2019, ACM Trans. Graph..