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

Andrew Nealen, Justus Pett, Marc Alexa, Takeo Igarashi

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    In this paper we present an algorithm for watertight meshing of closed, sketched curves. The sketch is resampled as a piecewise linear (PWL) curve and placed onto a triangular grid. A small boundary (seed) that describes a closed path along grid points is placed inside the sketch and grown until it resembles the sketch. Vertices of the evolved grid boundary are projected onto the stroke to establish a bijective, ordered mapping. Finally, valences along the boundary are optimized while retaining the previously established mapping. The resulting mesh patch can be duplicated, stitched and inflated to generate a new shape, or used to fill a hole in an existing shape. We have implemented our algorithm in FiberMesh [1], an interactive sketch based interface for designing freeform surfaces, where it is used for the all mesh generation processes. The triangulation generated with our algorithm improves the quality of the model by reducing the number of irregular vertices, while running at real time rates.

    Original languageEnglish (US)
    Title of host publication2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009
    Pages155-162
    Number of pages8
    DOIs
    StatePublished - 2009
    Event2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009 - Beijing, China
    Duration: Jun 26 2009Jun 28 2009

    Other

    Other2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009
    CountryChina
    CityBeijing
    Period6/26/096/28/09

    Fingerprint

    Mesh generation
    Triangulation
    Seed

    Keywords

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

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Computer Science Applications
    • Computer Vision and Pattern Recognition

    Cite this

    Nealen, A., Pett, J., Alexa, M., & Igarashi, T. (2009). GridMesh: Fast and high quality 2D mesh generation for interactive 3D shape modeling. In 2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009 (pp. 155-162). [5170143] https://doi.org/10.1109/SMI.2009.5170143

    GridMesh : Fast and high quality 2D mesh generation for interactive 3D shape modeling. / Nealen, Andrew; Pett, Justus; Alexa, Marc; Igarashi, Takeo.

    2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009. 2009. p. 155-162 5170143.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Nealen, A, Pett, J, Alexa, M & Igarashi, T 2009, GridMesh: Fast and high quality 2D mesh generation for interactive 3D shape modeling. in 2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009., 5170143, pp. 155-162, 2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009, Beijing, China, 6/26/09. https://doi.org/10.1109/SMI.2009.5170143
    Nealen A, Pett J, Alexa M, Igarashi T. GridMesh: Fast and high quality 2D mesh generation for interactive 3D shape modeling. In 2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009. 2009. p. 155-162. 5170143 https://doi.org/10.1109/SMI.2009.5170143
    Nealen, Andrew ; Pett, Justus ; Alexa, Marc ; Igarashi, Takeo. / GridMesh : Fast and high quality 2D mesh generation for interactive 3D shape modeling. 2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009. 2009. pp. 155-162
    @inproceedings{5ef8aec2099d46a4a4b518c1f6923a29,
    title = "GridMesh: Fast and high quality 2D mesh generation for interactive 3D shape modeling",
    abstract = "In this paper we present an algorithm for watertight meshing of closed, sketched curves. The sketch is resampled as a piecewise linear (PWL) curve and placed onto a triangular grid. A small boundary (seed) that describes a closed path along grid points is placed inside the sketch and grown until it resembles the sketch. Vertices of the evolved grid boundary are projected onto the stroke to establish a bijective, ordered mapping. Finally, valences along the boundary are optimized while retaining the previously established mapping. The resulting mesh patch can be duplicated, stitched and inflated to generate a new shape, or used to fill a hole in an existing shape. We have implemented our algorithm in FiberMesh [1], an interactive sketch based interface for designing freeform surfaces, where it is used for the all mesh generation processes. The triangulation generated with our algorithm improves the quality of the model by reducing the number of irregular vertices, while running at real time rates.",
    keywords = "Fair surface design, Interactive shape modeling, Mesh generation, Meshing, Sketch based modeling",
    author = "Andrew Nealen and Justus Pett and Marc Alexa and Takeo Igarashi",
    year = "2009",
    doi = "10.1109/SMI.2009.5170143",
    language = "English (US)",
    isbn = "9781424440702",
    pages = "155--162",
    booktitle = "2009 IEEE International Conference on Shape Modeling and Applications, SMI 2009",

    }

    TY - GEN

    T1 - GridMesh

    T2 - Fast and high quality 2D mesh generation for interactive 3D shape modeling

    AU - Nealen, Andrew

    AU - Pett, Justus

    AU - Alexa, Marc

    AU - Igarashi, Takeo

    PY - 2009

    Y1 - 2009

    N2 - In this paper we present an algorithm for watertight meshing of closed, sketched curves. The sketch is resampled as a piecewise linear (PWL) curve and placed onto a triangular grid. A small boundary (seed) that describes a closed path along grid points is placed inside the sketch and grown until it resembles the sketch. Vertices of the evolved grid boundary are projected onto the stroke to establish a bijective, ordered mapping. Finally, valences along the boundary are optimized while retaining the previously established mapping. The resulting mesh patch can be duplicated, stitched and inflated to generate a new shape, or used to fill a hole in an existing shape. We have implemented our algorithm in FiberMesh [1], an interactive sketch based interface for designing freeform surfaces, where it is used for the all mesh generation processes. The triangulation generated with our algorithm improves the quality of the model by reducing the number of irregular vertices, while running at real time rates.

    AB - In this paper we present an algorithm for watertight meshing of closed, sketched curves. The sketch is resampled as a piecewise linear (PWL) curve and placed onto a triangular grid. A small boundary (seed) that describes a closed path along grid points is placed inside the sketch and grown until it resembles the sketch. Vertices of the evolved grid boundary are projected onto the stroke to establish a bijective, ordered mapping. Finally, valences along the boundary are optimized while retaining the previously established mapping. The resulting mesh patch can be duplicated, stitched and inflated to generate a new shape, or used to fill a hole in an existing shape. We have implemented our algorithm in FiberMesh [1], an interactive sketch based interface for designing freeform surfaces, where it is used for the all mesh generation processes. The triangulation generated with our algorithm improves the quality of the model by reducing the number of irregular vertices, while running at real time rates.

    KW - Fair surface design

    KW - Interactive shape modeling

    KW - Mesh generation

    KW - Meshing

    KW - Sketch based modeling

    UR - http://www.scopus.com/inward/record.url?scp=70449580369&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=70449580369&partnerID=8YFLogxK

    U2 - 10.1109/SMI.2009.5170143

    DO - 10.1109/SMI.2009.5170143

    M3 - Conference contribution

    AN - SCOPUS:70449580369

    SN - 9781424440702

    SP - 155

    EP - 162

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

    ER -