6533b7dcfe1ef96bd12731ca

RESEARCH PRODUCT

Computing Subdivision Surface Intersection

S. LanquetinS. FoufouH. KheddouciM. Neveu

subject

průnik křivekgeometric modellinggeometrické modelovánírežim smyčky[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]intersection curvesčlenění povrchu[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]loop shemesubdivison surfacesComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]ComputingMethodologies_COMPUTERGRAPHICS

description

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.

yearjournalcountryeditionlanguage
2003-01-01
https://hal.archives-ouvertes.fr/hal-00188516