Approximating Geometric Domains through Topological Triangulations
暂无分享,去创建一个
[1] David Eppstein,et al. Provably Good Mesh Generation , 1994, J. Comput. Syst. Sci..
[2] Jim Ruppert,et al. A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.
[3] Godfried T. Toussaint,et al. Converting triangulations to quadrangulations , 1998, Comput. Geom..
[4] Philip M. Hubbard,et al. Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.
[5] David Eppstein,et al. MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .
[6] Christoph M. Hoffmann,et al. Geometric and Solid Modeling: An Introduction , 1989 .
[7] David Eppstein,et al. Triangulating polygons without large angles , 1992, SCG '92.
[8] Marshall W. Bern,et al. Linear-size nonobtuse triangulation of polygons , 1994, SCG '94.
[9] L. Paul Chew,et al. Guaranteed-Quality Triangular Meshes , 1989 .
[10] M. Carter. Computer graphics: Principles and practice , 1997 .
[11] Herbert Edelsbrunner,et al. Triangulating topological spaces , 1994, SCG '94.