Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userConstructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization
76
0
0.0
(
0
)
Added by
Jinlan Xu
Publication date
2017
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple boundary, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including Bezier extraction and subdivision are performed on each boundary curve in order to generate a high-quality planar parameterization; then a robust planar domain partition framework is proposed to construct high-quality patch-meshing results with few singularities from the discrete boundary formed by connecting the end points of the resulting boundary segments. After the topology information generation of quadrilateral decomposition, the optimal placement of interior Bezier curves corresponding to the interior edges of the quadrangulation is constructed by a global optimization method to achieve a patch-partition with high quality. Finally, after the imposition of C1=G1-continuity constraints on the interface of neighboring Bezier patches with respect to each quad in the quadrangulation, the high-quality Bezier patch parameterization is obtained by a C1-constrained local optimization method to achieve uniform and orthogonal iso-parametric structures while keeping the continuity conditions between patches. The efficiency and robustness of the proposed method are demonstrated by several examples which are compared to results obtained by the skeleton-based parameterization approach.
rate research
Read More
With the advancement in 3D scanning technology, there has been a surge of interest in the use of point clouds in science and engineering. To facilitate the computations and analyses of point clouds, prior works have considered parameterizing them onto some simple planar domains with a fixed boundary shape such as a unit circle or a rectangle. However, the geometry of the fixed shape may lead to some undesirable distortion in the parameterization. It is therefore more natural to consider free-boundary conformal parameterizations of point clouds, which minimize the local geometric distortion of the mapping without constraining the overall shape. In this work, we develop a free-boundary conformal parameterization method for disk-type point clouds, which involves a novel approximation scheme of the point cloud Laplacian with accumulated cotangent weights together with a special treatment at the boundary points. With the aid of the free-boundary conformal parameterization, high-quality point cloud meshing can be easily achieved. Furthermore, we show that using the idea of conformal welding in complex analysis, the point cloud conformal parameterization can be computed in a divide-and-conquer manner. Experimental results are presented to demonstrate the effectiveness of the proposed method.
Some methods based on simple regularizing geometric element transformations have heuristically been shown to give runtime efficient and quality effective smoothing algorithms for meshes. We describe the mathematical framework and a systematic approach to global optimization-bas
In computer-aided design (CAD), the ability to reverse engineer the modeling steps used to create 3D shapes is a long-sought-after goal. This process can be decomposed into two sub-problems: converting an input mesh or point cloud into a boundary representation (or B-rep), and then inferring modeling operations which construct this B-rep. In this paper, we present a new system for solving the second sub-problem. Central to our approach is a new geometric representation: the zone graph. Zones are the set of solid regions formed by extending all B-Rep faces and partitioning space with them; a zone graph has these zones as its nodes, with edges denoting geometric adjacencies between them. Zone graphs allow us to tractably work with industry-standard CAD operations, unlike prior work using CSG with parametric primitives. We focus on CAD programs consisting of sketch + extrude + Boolean operations, which are common in CAD practice. We phrase our problem as search in the space of such extrusions permitted by the zone graph, and we train a graph neural network to score potential extrusions in order to accelerate the search. We show that our approach outperforms an existing CSG inference baseline in terms of geometric reconstruction accuracy and reconstruction time, while also creating more plausible modeling sequences.
Magnetic levitation positioning technology has attracted considerable research efforts and dedicated attention due to its extremely attractive features. The technology offers high-precision, contactless, dust/lubricant-free, multi-axis, and large-stroke positioning. In this work, we focus on the accurate and smooth tracking problem of a multi-axis magnetically levitated (maglev) planar positioning system for a specific S-curve reference trajectory. The floating characteristics and the multi-axis coupling make accurate identification of the system dynamics difficult, which lead to a challenge to design a high performance control system. Here, the tracking task is achieved by a 2-Degree of Freedom (DoF) controller consisting of a feedforward controller and a robust stabilizing feedback controller with a prescribed sparsity pattern. The approach proposed in this paper utilizes the basis of an H-infinity controller formulation and a suitably established convex inner approximation. Particularly, a subset of robust stabilizable controllers with prescribed structural constraints is characterized in the parameter space, and so thus the re-formulated convex optimization problem can be easily solved by several powerful numerical algorithms and solvers. With this approach, the robust stability of the overall system is ensured with a satisfactory system performance despite the presence of parametric uncertainties. Furthermore, experimental results clearly demonstrate the effectiveness of the proposed approach.
We consider a particle diffusing outside a compact planar set and investigate its boundary local time $ell_t$, i.e., the rescaled number of encounters between the particle and the boundary up to time $t$. In the case of a disk, this is also the (rescaled) number of encounters of two diffusing circular particles in the plane. For that case, we derive explicit integral representations for the probability density of the boundary local time $ell_t$ and for the probability density of the first-crossing time of a given threshold by $ell_t$. The latter density is shown to exhibit a very slow long-time decay due to extremely long diffusive excursions between encounters. We briefly discuss some practical consequences of this behavior for applications in chemical physics and biology.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
