A graph based algorithm for intersection of subdivision surfaces

S. Lanquetin, Sebti Foufou, H. Kheddouci, M. Neveu

    Research output: Contribution to journalArticle

    Abstract

    Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the following levels of subdivision.

    Original languageEnglish (US)
    Pages (from-to)387-396
    Number of pages10
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2669
    StatePublished - Dec 1 2003

    Fingerprint

    Subdivision Surfaces
    Intersection
    Face
    Graph in graph theory
    Subdivision
    Bipartite Graph
    Surface Intersection
    Boolean Operation
    Geometric Modeling
    Robust Algorithm
    Deduce
    Efficient Algorithms
    Necessary
    Computing

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    A graph based algorithm for intersection of subdivision surfaces. / Lanquetin, S.; Foufou, Sebti; Kheddouci, H.; Neveu, M.

    In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2669, 01.12.2003, p. 387-396.

    Research output: Contribution to journalArticle

    @article{bfa90c86011143c58bf0f35979fcb4ba,
    title = "A graph based algorithm for intersection of subdivision surfaces",
    abstract = "Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the following levels of subdivision.",
    author = "S. Lanquetin and Sebti Foufou and H. Kheddouci and M. Neveu",
    year = "2003",
    month = "12",
    day = "1",
    language = "English (US)",
    volume = "2669",
    pages = "387--396",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    TY - JOUR

    T1 - A graph based algorithm for intersection of subdivision surfaces

    AU - Lanquetin, S.

    AU - Foufou, Sebti

    AU - Kheddouci, H.

    AU - Neveu, M.

    PY - 2003/12/1

    Y1 - 2003/12/1

    N2 - Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the following levels of subdivision.

    AB - Computing surface intersections is a fundamental problem in geometric modeling. Any boolean operation can be seen as an intersection calculation followed by a selection of the parts necessary for building the surface of the resulting object. A robust and efficient algorithm to compute intersection on subdivision surfaces (surfaces generated by the Loop scheme) is proposed here. This algorithm relies on the concept of a bipartite graph which allows the reduction of the number of faces intersection tests. Intersection computations are accelerated by the use of the bipartite graph and the neighborhood of intersecting faces at a given level of subdivision to deduce intersecting faces at the following levels of subdivision.

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

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

    M3 - Article

    VL - 2669

    SP - 387

    EP - 396

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -