0000000000400086
AUTHOR
H. Kheddouci
Computing Subdivision Surface Intersection
Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation can be seen as an intersection calculation followed by a selection of parts necessary for building the surface of the resulting object. This paper deals with the computing of intersection curveson subdivision surfaces (surfaces generated by the Loop scheme). We present three variants of our algorithm. The first variant calculates this intersection after classification of the object faces into intersecting and non-intersecting pairs of faces. the second variant is based on 1-neighborhood of the intersecting faces. The third variant uses the concept of bipartite graph.
Deux algorithmes d'intersection des surfaces de subdivision
National audience
Squelettisation des objets 3D par des projections
National audience
Feedback vertex set for distance and circulant graphs
National audience
Force d'irrégularité des graphes circulants
National audience