Computer Aided Geometric Design

• Hole closing and opening operations that manipulate a complex.
• Dependences ...

We use the canonical bases produced by the tri-partition algorithm in (Edelsbrunner and Ölsböck, 2018) to open and close holes in a polyhedral complex, K. In a concrete application, we consider the Delaunay mosaic of a finite set, we ...

• A new deformation algorithm for spatial septic PH curves is introduced.
• The ...

The notion of the rectifying control polygon of planar Pythagorean hodograph (PH) curve is extended to the spatial PH curves. We construct the Gauss–Legendre polygon by applying the Gauss–Legendre quadrature to the Pythagorean ...

The local refinement of PHT-splines (polynomial splines over hierarchical T-meshes) is achieved by a simple cross insertion, which may introduce superfluous control points or coefficients. By allowing split-in-half in mesh refinement, ...

• We extend PHT-splines to modified PHT-splines.
• We provide a refinement strategy ...

Determining the knot number and location is the most challenging problem in spline fitting. In this paper, we proposed a two-stage framework for calculating knots in spline fitting based on the unimodality property. Here, the ...

• We explore the unimodality property of B-splines and employ it to remove redundant knots from an initial knot vector. Since the unimodality property reveals ...

Recently, 3D visual representations of highly deformable 3D models, such as dynamic 3D meshes, are becoming popular due to their capability to represent realistically the motion of real-world objects/humans, paving the road for new and ...

• A scalable coding method for reliable adaptive representation of dynamic 3D meshes.