Related papers: Incorporating Sharp Features in the General Solid …
Computing a quasi-developable strip surface bounded by design curves finds wide industrial applications. Existing methods compute discrete surfaces composed of developable lines connecting sampling points on input curves which are not…
Existing semantic segmentation approaches either aim to improve the object's inner consistency by modeling the global context, or refine objects detail along their boundaries by multi-scale feature fusion. In this paper, a new paradigm for…
We fully generalize a previously-developed computational geometry tool [1] to perform large-scale simulations of arbitrary two-dimensional faceted surfaces $z = h(x,y)$. Our method uses a three-component facet/edge/junction storage model,…
We propose a new formulation for integrating over smooth curves and surfaces that are described by their closest point mappings. Our method is designed for curves and surfaces that are not defined by any explicit parameterization and is…
We investigate geometric properties of surfaces given by certain formulae. In particular, we calculate the singular curvature and the limiting normal curvature of such surfaces along the set of singular points consisting of singular points…
Excellent performance has been achieved on instance segmentation but the quality on the boundary area remains unsatisfactory, which leads to a rising attention on boundary refinement. For practical use, an ideal post-processing refinement…
In this work a novel method for the analysis with trimmed CAD surfaces is presented. The method involves an additional mapping step and the attraction stems from its sim- plicity and ease of implementation into existing Finite Element (FEM)…
This paper brings together three distinct theories with the goal of quantifying shape textures with complex morphologies. Distance fields are central objects in shape representation, while topological data analysis uses algebraic topology…
We introduce a library of geometric voxel features for CAD surface recognition/retrieval tasks. Our features include local versions of the intrinsic volumes (the usual 3D volume, surface area, integrated mean and Gaussian curvature) and a…
We describe an efficient algorithm to compute a conformally equivalent metric for a discrete surface, possibly with boundary, exhibiting prescribed Gaussian curvature at all interior vertices and prescribed geodesic curvature along the…
In this paper the full and exhaustive algorithm of formation of a smooth molecular Solvent Excluded Surface- SES, and also Solvent Accessible Surface- SAS is presented. These surfaces are a boundary between molecule and solvent. The basis…
Surface geometry plays a central role in the design of bridges, vaults and shells, using various techniques for generating a geometry which aims to balance structural, spatial, aesthetic and construction requirements. In this paper we…
This paper deals with a new solid-fluid coupling algorithm between a rigid body and an unsteady compressible fluid flow, using an Embedded Boundary method. The coupling with a rigid body is a first step towards the coupling with a Discrete…
This work introduces a scaffolding framework to compactly parametrise solid structures with conforming NURBS elements for isogeometric analysis. A novel formulation introduces a topological, geometrical and parametric subdivision of the…
The emergence of explainability methods has enabled a better comprehension of how deep neural networks operate through concepts that are easily understood and implemented by the end user. While most explainability methods have been designed…
We present an immersed boundary method to simulate the creeping motion of a rigid particle in a fluid described by the Stokes equations discretized thanks to a finite element strategy on unfitted meshes, called Phi-FEM, that uses the…
With the rapid development of high-resolution 3D vision applications, the traditional way of manipulating surface detail requires considerable memory and computing time. To address these problems, we introduce an efficient surface detail…
We introduce an arbitrary order, computationally efficient method to smooth corners on curves in the plane, as well as edges and vertices on surfaces in $\mathbb R^3$. The method is local, only modifying the original surface in a…
Polyhedral surfaces are fundamental objects in architectural geometry and industrial design. Whereas closeness of a given mesh to a smooth reference surface and its suitability for numerical simulations were already studied extensively, the…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…