Isogeometric segmentation: Construction of auxiliary curves

In the context of segmenting a boundary represented solid into topological hexahedra suitable for isogeometric analysis, it is often necessary to split an existing face by constructing auxiliary curves. We consider solids represented as a collection of trimmed spline surfaces, and design a curve which can split the domain of a trimmed surface into two pieces satisfying the following criteria: the curve must not intersect the boundary of the original domain, it must not intersect itself, the two resulting pieces should have good shape, and the endpoints and the tangents of the curve at the endpoints must be equal to specified values. A method is proposed for splitting a trimmed surface into two with a curve.The curve is required to have specified endpoints and tangents at the endpoints.The splitting is central to an algorithm for isogeometric segmentation of 3D models.The curve optimizes a penalty function that measures the quality of the shapes.We study regularity properties and methods for computing the penalty function.

[1]  Pankaj K. Agarwal,et al.  Motion planning for a steering-constrained robot through moderate obstacles , 1995, STOC '95.

[2]  Christoph Reisinger,et al.  Penalty Methods for the Solution of Discrete HJB Equations - Continuous Control and Obstacle Problems , 2012, SIAM J. Numer. Anal..

[3]  Les A. Piegl,et al.  The NURBS book (2nd ed.) , 1997 .

[4]  Gershon Elber,et al.  Surface self-intersection computation via algebraic decomposition , 2009, Comput. Aided Des..

[5]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[6]  Les A. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communication.

[7]  Jean-Paul Laumond,et al.  Guidelines in nonholonomic motion planning for mobile robots , 1998 .

[8]  Thomas J. R. Hughes,et al.  Isogeometric Analysis: Toward Integration of CAD and FEA , 2009 .

[9]  Yutaka Kanayama,et al.  Smooth local path planning for autonomous vehicles , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[10]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[11]  Gershon Elber,et al.  Self-intersection elimination in metamorphosis of two-dimensional curves , 1998, The Visual Computer.

[12]  Bert Jüttler,et al.  Isogeometric segmentation. Part II: On the segmentability of contractible solids with non-convex edges , 2014, Graph. Model..

[13]  Thierry Fraichard,et al.  Continuous-curvature path planning for car-like vehicles , 1997, Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97.

[14]  J. Oliver,et al.  Synthesis of spatially and intrinsically constrained curves using simulated annealing , 1996 .

[15]  Dereck S. Meek,et al.  A smooth, obstacle-avoiding curve , 2006, Comput. Graph..

[16]  Xilu Wang,et al.  An optimization approach for constructing trivariate B-spline solids , 2014, Comput. Aided Des..

[17]  Gershon Elber,et al.  Self-intersection detection and elimination in freeform curves and surfaces , 2008, Comput. Aided Des..

[18]  Ching-Chih Tsai,et al.  Parallel Elite Genetic Algorithm and Its Application to Global Path Planning for Autonomous Robot Navigation , 2011, IEEE Transactions on Industrial Electronics.

[19]  John F. Canny,et al.  Planning smooth paths for mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[20]  Bert Jüttler,et al.  The Isogeometric Segmentation Pipeline , 2015 .

[21]  Mario Kapl,et al.  Isogeometric segmentation: The case of contractible solids without non-convex edges , 2014, Comput. Aided Des..

[22]  Shigefumi Tamura,et al.  Curvature continuous path generation for autonomous vehicle using B-spline curves , 2010, Comput. Aided Des..

[23]  Jörg Peters,et al.  Threading splines through 3D channels , 2005, Comput. Aided Des..