High quality compatible triangulations

Engineering with Computers

Volumn 20, Issue 2, 2004, Pages 147-156

  Surazhsky, Vitus ^a   Gotsman, C ^b  

^a UNIVERSITY OF OSLO   (Norway)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Compatible triangulations; Low discrepancy point sets; Morphing; Remeshing; Sweep meshes

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; FINITE ELEMENT METHOD; THREE DIMENSIONAL COMPUTER GRAPHICS;

COMPATIBLE TRIANGULATIONS; LOW DISCREPEANCY POINT SETS; REMESHING; SWEEP MESHES;

COMPUTER SIMULATION;

EID: 14844366102     PISSN: 01770667     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00366-004-0282-6     Document Type: Article

References (23)

1. Staten ML, Canann SA, Owen SJ (1998) BMSweep: Locating interior nodes during sweeping. In: Proceedings of the 7th International Meshing Roundtable, 26-28 October 1998, Dearborn, MI, USA, pp 7-18
2. Shapira M, Rappoport A (1995) Shape blending using the star-skeleton representation. IEEE Trans Comput Graphics Applic 15(2):44-51
3. Sederberg TW, Greenwood E (1992) A physically based approach to 2D shape blending. Comput Graphics (SIGGRAPH '92) 26:25-34
4. Sederberg TW, Gao P, Wang G, Mu H (1993) 2D shape blending: An intrinsic solution to the vertex path problem. Comput Graphics (SIGGRAPH '93) 27:15-18
5. Aronov B, Seidel R, Souvaine DL (1993) On compatible triangulations of simple polygons. Comput Geom Theor Applic 3:27-35
6. Gotsman C, Surazhsky V (2001) Guaranteed intersection-free polygon morphing. Comput Graphics 25:67-75
7. Kranakis E, Urrutia J (1999) Isomorphic triangulations with small number of Steiner points. Int J Comput Geom Applic 9:171-180
8. Gupta H, Wenger R (1997) Constructing piecewise linear homeomorphisms of simple polygons. J Algorithms 22:142-157
9. Alexa M, Cohen-Or D, Levin D (2000) As-rigid-as-possible polygon morphing. In: Proceedings of SIGGRAPH 2000, 23-28 July 2000, New Orleans, LA, pp 157-164
10. Blacker T (1996) The Cooper tool. In: Proceedings of the 5th International Meshing Roundtable, 10-11 October 1996, Pittsburgh, PA, pp 13-19
11. Knupp PM (1998) Next generation sweep tool: A method for generating all-hex meshes and two and one-half dimensional geometries. In: Proceedings of the 7th International Meshing Roundtable, 26-28 October 1998, Dearborn, MI, pp 505-514
12. Floater MS, Gotsman C (1999) How to morph tilings injectively. Comput Appl Math 101:117-129
13. Surazhsky V, Gostman C (2001) Controllable morphing of compatible planar triangulations. ACM Trans Graphics 20:203-231
14. Tutte WT (1963) How to draw a graph. Proc Lond Math Soc 13:743-768
15. Floater MS (1997) Parameterization and smooth approximation of surface triangulation. Comput Aided Geom Design 14:231-250
16. Babikov M, Souvaine DL, Wenger R (1997) Constructing piecewise linear homeomorphisms of polygons with holes. In: Proceedings of the 9th Canadian Conference on Computational geometry, 11-14 August 1997, Kingston, Ontario, Canada, pp 6-10
17. Suri S (1986) A linear time algorithm for minimum link paths inside a simple polygon. Comput Vis Graph Image Process 35:99-110
18. Suri S (1990) On some link distance problems in a simple polygon. IEEE J Robotics Automat 6:108-113
19. Zhou T, Shimada K (2000) An angle-based approach to two-dimensional mesh smoothing. In: Proceedings of the 9th International Meshing Roundtable, 2-5 October 2000, New Orleans, LA, pp 373-384 2-5 October 2000, New Orleans, LA
20. Niederreiter H (1992) Random number generation and quasi-Monte Carlo Methods. SIAM
21. Canann SA, Tristano JR, Staten ML (1998) An approach to combined Laplacian and optimization-based smoothing for triangular, quadrilateral, and quad dominant meshes. In: Proceedings of the 7th International Meshing Roundtable, 26-28 October 1998, Dearborn, MI, pp 479-496
22. Parthasarathy V, Kodiyalam S (1991) A constrained optimization approach to finite element mesh smoothing. Finite Elem Anal Design 9:309-320
23. Berzins M (1998) Mesh quality: A function of geometry, error estimates or both? In: Proceedings of the 7th International Meshing Roundtable, 26-28 October 1998, Dearborn, MI, pp 229-238