GridMesh: Fast and high quality 2D mesh generation for interactive 3D shape modeling

2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009

Volumn , Issue , 2009, Pages 155-162

  Nealen, Andrew ^a   Pett, Justus ^b   Alexa, Marc ^b,c   Igarashi, Takeo ^d  

^a RUTGERS UNIVERSITY   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^c DISNEY RESEARCH   (United States)

^d UNIVERSITY OF TOKYO   (Japan)

Author keywords

Fair surface design; Interactive shape modeling; Mesh generation; Meshing; Sketch based modeling

Indexed keywords

3-D SHAPE; FAIR SURFACE DESIGN; FREE-FORM SURFACE; GRID POINTS; HIGH QUALITY; INTERACTIVE SHAPE MODELING; INTERACTIVE SKETCH; MESHING; PIECEWISE LINEAR; REAL TIME; SKETCH BASED MODELING; TRIANGULAR GRID;

MESH GENERATION; PIECEWISE LINEAR TECHNIQUES; TWO DIMENSIONAL;

THREE DIMENSIONAL;

EID: 70449580369     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SMI.2009.5170143     Document Type: Conference Paper

References (25)

1. Andrew Nealen, Takeo Igarashi, Olga Sorkine, and Marc Alexa. FiberMesh: Designing freeform surfaces with 3d curves. ACM Transactions on Graphics (Proceedings of ACM SIGGRAPH), 26(3), 2007. article No. 41.
2. Takeo Igarashi, Satoshi Matsuoka, and Hidehiko Tanaka. Teddy: A sketching interface for 3D freeform design. In ACM SIGGRAPH, pages 409-416, 1999.
3. Takeo Igarashi and John F. Hughes. Smooth meshes for sketchbased freeform modeling. In ACM Symposium on Interactive 3D Graphics, pages 139-142, 2003.
4. Olga A. Karpenko and John F. Hughes. SmoothSketch: 3D free-form shapes from complex sketches. ACM Trans. Graph., 25(3):589-598, 2006.
5. Levent Burak Kara and Kenji Shimada. Sketch-based 3D shape creation for industrial styling design. IEEE Computer Graphics and Applications, 27(1):60-71, 2007.
6. Marko Lamot and Borut Zalik. An overview of triangulation algorithms for simple polygons. In International Conference on Information Visualisation IV, pages 153-159, 1999.
7. N. J. Lennes. Theorems on the simple finite polygon and polyhedron. Am. J. Math., 33:37-62, 1911.
8. G.H. Meisters. Polygons have ears. Amer. Math., 82:648-651,1975.
9. M. R. Garey, D. S. Johnson, F. P. Preparata, and R. E. Tarjan.Triangulating a simple polygon. IPL: Information Processing Letters, 7:175-179, 1978.
10. Bernard Chazelle. A theorem on polygon cutting with applications. In FOCS: IEEE Symposium on Foundations of Computer Science (FOCS), pages 339-349, 1982.
11. David G. Kirkpatrick, Maria M. Klawe, and Robert Endre Tarjan. Polygon triangulation in O(n log log n) time with simple data structures. Discrete & Computational Geometry, 7:329-346, 1992.
12. Raimund Seidel. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry, 1:51-64, 1991.
13. B. A. Lewis and J. S. Robinson. Triangulation of planar regions with applications. Computer Journal, 21:324-332, November 1978.
14. L. de Floriani and E. Puppo. An on-line algorithm for constrained delaunay triangulation. Graphical Models and Image Processing, 54(4):290-300, July 1992.
15. Jonathan Richard Shewchuk. Triangle: Engineering a 2d quality mesh generator and delaunay triangulator. In FCRC '96/WACG '96: Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering, pages 203-222, 1996.
16. P. Chew. Guaranteed-quality triangular meshes. Technical Report 89-893, Cornell University, Computer Science, 1989.
17. Jim Ruppert. A delaunay refinement algorithm for quality 2-dimensional mesh generation. Journal of Algorithms, 18(3):548-585, 1995.
18. Brenda S. Baker, Eric Grosse, and Conor S. Rafferty. Nonobtuse triangulation of polygons. Discrete Comput. Geom., 3(2):147-168, 1988.
19. Marshall Bern and David Eppstein. Mesh generation and optimal triangulation. Technical Report P92-00047, Xerox PARC, 1992.
20. Marshall Bern, Scott Mitchell, and Jim Ruppert. Linear-size nonobtuse triangulation of polygons. In SCG '94: Proceedings of the tenth annual symposium on Computational geometry, pages 221-230, 1994.
21. François Labelle and Jonathan Richard Shewchuk. Isosurface stuffing: fast tetrahedral meshes with good dihedral angles. In SIGGRAPH '07: ACM SIGGRAPH 2007 papers, page 57, 2007.
22. Kun Zhou, Jin Huang, John Snyder, Xinguo Liu, Hujun Bao, Baining Guo, and Heung-Yeung Shum. Large mesh deformation using the volumetric graph laplacian. In SIGGRAPH '05: ACM SIGGRAPH 2005 Papers, pages 496-503, 2005.
23. Yanlin Weng, Weiwei Xu, Yanchen Wu, Kun Zhou, and Baining Guo. 2d shape deformation using nonlinear least squares optimization. Vis. Comput., 22(9):653-660, 2006.
24. Fŕed́eric Chazal, Andŕe Lieutier, and Jarek Rossignac:. Projection-homeomorphic surfaces. In SPM '05: Proceedings of the 2005 ACM symposium on Solid and physical modeling, pages 9-14, 2005.
25. Eitan Grinspun, Mathieu Desbrun, Konrad Polthier, Peter Schröder, and Ari Stern. Discrete differential geometry: An applied introduction. SIGGRAPH 2006 Course Notes, http://ddg.cs.columbia.edu, 2006.