Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of
data structures and geometry processing algorithms based on them has been developed in …

We review the computation of 3D geometric data map**, which establishes one-to-one
correspondence between or among spatial/spatiotemporal objects. Effective map** …

Despite the success of quad‐based 2D surface parameterization methods, effective
parameterization algorithms for 3D volumes with cubes, ie hexahedral elements, are still …

While hexahedral mesh elements are preferred by a variety of simulation techniques,
constructing quality all‐hex meshes of general shapes remains a challenge. An attractive …

A comprehensive scheme is described to construct rational trivariate solid T-splines from
boundary triangulations with arbitrary topology. To extract the topology of the input …

PolyCubes, or orthogonal polyhedra, are useful as parameterization base-complexes for
various operations in computer graphics. However, computing quality PolyCube base …

Polycube maps of triangle meshes have proved useful in a wide range of applications,
including texture map** and hexahedral mesh generation. However, constructing either …

Volumetric PolyCube-Map-based methods offer automatic ways to construct all-hexahedral
meshes for closed 3D polyhedral domains, but their meshing quality is limited by the lack of …

PolyCubes provide compact representations for closed complex shapes and are essential to
many computer graphics applications. Existing automatic PolyCube construction methods …