Region extraction in mesh intersection

Region extraction is a very common task in both Computer Science and Engineering with several applications in object recognition and motion analysis, among others. Most of the literature focuses on regions delimited by straight lines, often in the special case of intersection detection among two unstructured meshes. While classical region extraction algorithms for line drawings and mesh intersection algorithms have proved to be able to deal with many applications, the advances in Isogeometric Analysis require a generalization of such problem to the case in which the regions to be extracted are bounded by an arbitrary number of curved segments. In this work we present a novel region extraction algorithm that allows a precise numerical integration of functions defined in different spline spaces. The presented algorithm has several interesting applications in contact problems, mortar methods, and quasi-interpolation problems.

[1]  P. Alam.  ‘T’ , 2021, Composites Engineering: An A–Z Guide.

[2]  Ronald D. Dutton,et al.  Efficiently identifying the faces of a solid , 1983, Comput. Graph..

[3]  Steven J. Plimpton,et al.  A Parallel Rendezvous Algorithm for Interpolation Between Multiple Grids , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[4]  P. Alam.  ‘G’ , 2021, Composites Engineering: An A–Z Guide.

[5]  Barbara Wohlmuth,et al.  Isogeometric mortar methods , 2014, 1407.8313.

[6]  Martin J. Gander,et al.  Algorithm 932: PANG: Software for nonmatching grid projections in 2D and 3D with linear complexity , 2013, TOMS.

[7]  Gershon Elber,et al.  Heterogeneous parametric trivariate fillets , 2021, Comput. Aided Geom. Des..

[8]  Cv Clemens Verhoosel,et al.  Image-based goal-oriented adaptive isogeometric analysis with application to the micro-mechanical modeling of trabecular bone , 2015 .

[9]  Rainald Löhner,et al.  Adaptive remeshing for transient problems , 1989 .

[10]  T. Lyche,et al.  Some examples of quasi-interpolants constructed from local spline projectors , 2001 .

[11]  15 I , 2019, Memorix Kindernotfälle.

[12]  Annalisa Buffa,et al.  Immersed boundary-conformal isogeometric method for linear elliptic problems , 2020, Computational Mechanics.

[13]  Horst Bunke,et al.  An optimal algorithm for extracting the regions of a plane graph , 1993, Pattern Recognit. Lett..

[14]  Z. Zou,et al.  Isogeometric Bézier dual mortaring: Refineable higher-order spline dual bases and weakly continuous geometry , 2017, 1711.01009.

[15]  M. H. Kuo.  Automatic extraction of quadric surfaces from wire-frame models , 2001, Comput. Graph..

[16]  Peter Betsch,et al.  Isogeometric analysis and domain decomposition methods , 2012 .

[17]  A. Michelson,et al.  Fourier's Series , 1898, Nature.

[18]  PeiZong Lee,et al.  Fast algorithms for computing self-avoiding walks and mesh intersections over unstructured meshes , 2003 .

[19]  Surface extraction from line drawings of a polyhedron , 1991, Pattern Recognit. Lett..

[20]  Thibaut Hirschler,et al.  Quadrature-free immersed isogeometric analysis , 2021, Engineering with Computers.

[21]  Richard C. T. Lee,et al.  A systolic algorithm for extracting regions from a planar graph , 1989, Comput. Vis. Graph. Image Process..

[22]  Barbara Wohlmuth,et al.  Isogeometric dual mortar methods for computational contact mechanics , 2016 .

[23]  John A. Brewer,et al.  Automated conversion of curvilinear wire-frame models to surface boundary models; a topological approach , 1986, SIGGRAPH.

[24]  Rainald Löhner,et al.  Some useful data structures for the generation of unstructured grids , 1988 .

[25]  L. Heffter.  Ueber das Problem der Nachbargebiete , 1891 .

[26]  Annalisa Buffa,et al.  Overlapping Multipatch Isogeometric Method with Minimal Stabilization , 2021, SIAM J. Sci. Comput..