1,537 research outputs found
Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization
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
B\'ezier 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 B\'ezier 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 B\'ezier patches
with respect to each quad in the quadrangulation, the high-quality B\'ezier
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
Computing a Compact Spline Representation of the Medial Axis Transform of a 2D Shape
We present a full pipeline for computing the medial axis transform of an
arbitrary 2D shape. The instability of the medial axis transform is overcome by
a pruning algorithm guided by a user-defined Hausdorff distance threshold. The
stable medial axis transform is then approximated by spline curves in 3D to
produce a smooth and compact representation. These spline curves are computed
by minimizing the approximation error between the input shape and the shape
represented by the medial axis transform. Our results on various 2D shapes
suggest that our method is practical and effective, and yields faithful and
compact representations of medial axis transforms of 2D shapes.Comment: GMP14 (Geometric Modeling and Processing
A relaxed approach for curve matching with elastic metrics
In this paper we study a class of Riemannian metrics on the space of
unparametrized curves and develop a method to compute geodesics with given
boundary conditions. It extends previous works on this topic in several
important ways. The model and resulting matching algorithm integrate within one
common setting both the family of -metrics with constant coefficients and
scale-invariant -metrics on both open and closed immersed curves. These
families include as particular cases the class of first-order elastic metrics.
An essential difference with prior approaches is the way that boundary
constraints are dealt with. By leveraging varifold-based similarity metrics we
propose a relaxed variational formulation for the matching problem that avoids
the necessity of optimizing over the reparametrization group. Furthermore, we
show that we can also quotient out finite-dimensional similarity groups such as
translation, rotation and scaling groups. The different properties and
advantages are illustrated through numerical examples in which we also provide
a comparison with related diffeomorphic methods used in shape registration.Comment: 27 page
08221 Abstracts Collection -- Geometric Modeling
From May 26 to May 30 2008 the Dagstuhl Seminar 08221 ``Geometric Modeling\u27\u27 was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Crafting chaos: computational design of contraptions with complex behaviour
The 2010s saw the democratisation of digital fabrication technologies. Although this phenomenon made fabrication more accessible, physical assemblies displaying a complex behaviour are still difficult to design. While many methods support the creation of complex shapes and assemblies, managing a complex behaviour is often assumed to be a tedious aspect of the design process. As a result, the complex parts of the behaviour are either deemed negligible (when possible) or managed directly by the software, without offering much fine-grained user control. This thesis argues that efficient methods can support designers seeking complex behaviours by increasing their level of control over these behaviours. To demonstrate this, I study two types of artistic devices that are particularly challenging to design: drawing machines, and chain reaction contraptions. These artefacts’ complex behaviour can change dramatically even as their components are moved by a small amount. The first case study aims to facilitate the exploration and progressive refinement of complex patterns generated by drawing machines under drawing-level user-defined constraints. The approach was evaluated with a user study, and several machines drawing the expected pattern were fabricated. In the second case study, I propose an algorithm to optimise the layout of complex chain reaction contraptions described by a causal graph of events in order to make them robust to uncertainty. Several machines optimised with this method were successfully assembled and run. This thesis makes the following contributions: (1) support complex behaviour specifications; (2) enable users to easily explore design variations that respect these specifications; and (3) optimise the layout of a physical assembly to maximise the probability of real-life success
Non-rigid registration of 2-D/3-D dynamic data with feature alignment
In this work, we are computing the matching between 2D manifolds and 3D manifolds with temporal constraints, that is we are computing the matching among a time sequence of 2D/3D manifolds. It is solved by mapping all the manifolds to a common domain, then build their matching by composing the forward mapping and the inverse mapping. At first, we solve the matching problem between 2D manifolds with temporal constraints by using mesh-based registration method. We propose a surface parameterization method to compute the mapping between the 2D manifold and the common 2D planar domain. We can compute the matching among the time sequence of deforming geometry data through this common domain. Compared with previous work, our method is independent of the quality of mesh elements and more efficient for the time sequence data. Then we develop a global intensity-based registration method to solve the matching problem between 3D manifolds with temporal constraints. Our method is based on a 4D(3D+T) free-from B-spline deformation model which has both spatial and temporal smoothness. Compared with previous 4D image registration techniques, our method avoids some local minimum. Thus it can be solved faster and achieve better accuracy of landmark point predication. We demonstrate the efficiency of these works on the real applications. The first one is applied to the dynamic face registering and texture mapping. The second one is applied to lung tumor motion tracking in the medical image analysis. In our future work, we are developing more efficient mesh-based 4D registration method. It can be applied to tumor motion estimation and tracking, which can be used to calculate the read dose delivered to the lung and surrounding tissues. Thus this can support the online treatment of lung cancer radiotherapy
Profile extrema for visualizing and quantifying uncertainties on excursion regions. Application to coastal flooding
We consider the problem of describing excursion sets of a real-valued
function , i.e. the set of inputs where is above a fixed threshold. Such
regions are hard to visualize if the input space dimension, , is higher than
2. For a given projection matrix from the input space to a lower dimensional
(usually ) subspace, we introduce profile sup (inf) functions that
associate to each point in the projection's image the sup (inf) of the function
constrained over the pre-image of this point by the considered projection.
Plots of profile extrema functions convey a simple, although intrinsically
partial, visualization of the set. We consider expensive to evaluate functions
where only a very limited number of evaluations, , is available, e.g.
, and we surrogate with a posterior quantity of a Gaussian process
(GP) model. We first compute profile extrema functions for the posterior mean
given evaluations of . We quantify the uncertainty on such estimates by
studying the distribution of GP profile extrema with posterior
quasi-realizations obtained from an approximating process. We control such
approximation with a bound inherited from the Borell-TIS inequality. The
technique is applied to analytical functions () and to a -dimensional
coastal flooding test case for a site located on the Atlantic French coast.
Here is a numerical model returning the area of flooded surface in the
coastal region given some offshore conditions. Profile extrema functions
allowed us to better understand which offshore conditions impact large flooding
events
- …