Arc fibrations of planar domains
From MaRDI portal
Publication:2010279
DOI10.1016/j.cagd.2019.04.010zbMath1505.65065OpenAlexW2926088997WikidataQ128101326 ScholiaQ128101326MaRDI QIDQ2010279
Bert Jüttler, Q. Youn Hong, Sofia Maroscheck, Myung-Soo Kim
Publication date: 27 November 2019
Published in: Computer Aided Geometric Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cagd.2019.04.010
Finite element methods applied to problems in solid mechanics (74S05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items
Measuring the local non-convexity of real algebraic curves, Detection and computation of conservative kernels of models consisting of freeform curves and surfaces, using inequality constraints, Kernel-based construction operators for Boolean sum and ruled geometry, Representing planar domains by polar parameterizations with parabolic parameter lines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
- Computational geometry in a curved world
- Isogeometric analysis enhanced by the scaled boundary finite element method
- \(C^2\) rational quartic/cubic spline interpolant with shape constraints
- A NURBS based Galerkin approach for the analysis of solids in boundary representation
- A circle representation using complex and quaternion numbers
- COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION
- Geometry of Möbius Transformations
- THE KERNEL OF A FREEFORM SURFACE AND ITS DUALITY WITH THE CONVEX HULL OF ITS TANGENTIAL SURFACE
- Some NP-hard polygon decomposition problems
- An Optimal Algorithm for Finding the Kernel of a Polygon
