Overlaying surface meshes, part I: Algorithms

International Journal of Computational Geometry and Applications

Volumn 14, Issue 6, 2004, Pages 379-402

  Jiao, Xiangmin ^a   Heath, Michael T ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Common refinement; Computational geometry; Data transfer; Edge intersection; Inexact computation; Mesh overlay; Robustness; Topological consistency

Indexed keywords

EID: 10644223921     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195904001512     Document Type: Article

References (30)

1. X. Jiao and M. T. Heath, Common-refinement based data transfer between non-matching meshes in multiphysics simulations, Int. J. Numer. Meth. Engrg. (2004), to appear.
2. J. R. Cebral and R. Löhner, Conservative load projection and tracking for fluid-structure problems, AIAA J. 35 (1997) 687-692.
3. J. K. Dukowicz, Conservative rezoning (remapping) for general quadrilateral meshes, J. Comput. Phys. 54 (1984) 411-424.
4. J. D. Ramshaw, Conservative rezoning algorithm for generalized two-dimensional meshes, J. Comput. Phys. 59 (1985) 193-199.
5. T. Kanal, H. Suzuki and F. Kimura, Metamorphosis of arbitrary triangular meshes, IEEE Comput. Graph. & Appl. 20 (2000) 62-75.
6. M. Alexa, Merging polyhedral shapes with scattered features, Visual Comput. 16 (2000) 26-37.
7. J. R. Kent, W. E. Carlson and R. E. Parent, Shape transformation for polyhedral objects, Comput. Graph. 26 (1992) 47-54.
8. M. de Berg, M. van Kreveld, M. Overmans and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2nd edition (Springer, Berlin, 2000).
9. I. J. Balaban, An optimal algorithm for finding segments intersections, in Proc. 11th Ann. ACM Sympos. Comput. Geom., Vancouvar, Canada (June 1995) pp. 211-219.
10. B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, J. ACM 39 (1992) 1-54.
11. U. Finke and K. H. Hinrichs, Overlaying simply connected planar subdivisions in linear time, in Proc. 11th Ann. ACM Sympos. Comput. Geom., Vancouvar, Canada (June 1995) pp. 119-126.
12. L. J. Guibas and R. Seidel, Computing convolutions by reciprocal search, Disc. & Comput. Geom. 2 (1987) 175-193.
13. H. Edelsbrunner and E. P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Trans. Graph. 9 (1990) 66-104.
14. S. Fortune, Robustness issues in geometric algorithms, in Applied Computational Geometry, eds. M. C. Lin and D. Manocha (Springer, Berlin, 1996) pp. 9-14.
15. L. Guibas, D. Salesin and J. Stolfi, Epsilon geometry: building robust algorithms from imprecise computations, in Proc. 5th Ann. ACM Sympos. Comput. Geom., Saarbruchen, Germany (June 1989) pp. 208-217.
16. C. M. Hoffmann, J. E. Hopcroft and M. S. Karasick, Towards implementing robust geometric computations, in Proc. 4th Ann. ACM Sympos. Comput. Geom., Urbana-Champaign, IL (June 1988) pp. 106-117.
17. V. J. Milenkovic, Verifiable implementations of geometric algorithms using finite precision arithmetic, Artifi. Intell. 1 (1988) 377-401.
18. C. K. Yap, Symbolic treatment of geometric degeneration, J. Symb. Comput. 10 (1990) 349-370.
19. M. T. Goodrich, L. J. Guibas, J. Hershberger and P. J. Tanenbaum, Snap rounding line segments efficiently in two and three dimensions, in Proc. 13th Ann. ACM Sympos. Comput. Geom., Nice, France (June 1997) pp. 284-293.
20. D. Halperin and E. Packer, Iterated snap rounding, Comput. Geom. Theory Appl. 23 (2002) 209-225.
21. E. D. Bloch, A First Course in Geometric Topology and Differential Geometry (Birkhäuser, Boston, 1997).
22. H. Edelsbrunner, Geometry and Topology for Mesh Generation (Cambridge University Press, Cambridge, 2001).
23. L. Kobbelt, T. Bareuther and H.-P. Seidel, Multiresolution shape deformations for meshes with dynamic vertex connectivity, in Proc. EUROGRAPHICS 2000, Interlaken, Switzerland (Aug. 2000) pp. 249-260.
24. D. P. Huttenlocher and K. Kedem, Computing the minimum Hausdorff distance for point sets under translation, in Proc. 6th Ann. ACM Sympos. Comput. Geom., Berkeley, CA (June 1990) pp. 340-349.
25. L. Kettner, Designing a data structure for polyhedral surfaces, in Proc. 14th Ann. ACM Sympos. Comput. Geom., Minneapolis, MN (June 1998) pp. 146-154.
26. L. J. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Trans. Graph. 4 (1985) 74-123.
27. B. G. Baumgart, A polyhedron representation for computer vision, in Proc. Natl. Comput. Conf. 44 (AFIPS Press, NJ, 1975) pp. 589-596.
28. X. Jiao, H. Edelsbrunner and M. T. Heath, Mesh association: formulation and algorithms, in 8th Int. Meshing Roundtable, South Lake Taho, CA, (1999) pp. 75-82.
29. M. T. Heath, Scientific Computing: An Introductory Survey, 2nd edition (McGraw-Hill, New York, 2002).
30. S. Schirra, R. Veltkamp and M. Yvinec, CGAL basic library reference manual (http://www.cgal.org, 2000).