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

This paper presents a novel algorithm which uses skeleton-based polycube generation to
construct feature-preserving T-meshes. From the skeleton of the input model, we first …

We present a new method to compute continuous and bijective maps (surface
homeomorphisms) between two or more genus‐0 triangle meshes. In contrast to previous …

The problem of discrete surface parametrization, ie mapping a mesh to a planar domain, has
been investigated extensively. We address the more general problem of mapping between …

Polycube map is a global cross-surface parameterization technique, where the polycube
shape can roughly approximate the geometry of modeled objects while retaining the same …

In virtual colonoscopy, CT scans are typically acquired with the patient in both supine (facing
up) and prone (facing down) positions. The registration of these two scans is desirable so …

This paper proposes a novel method for computing bijective density-equalizing
quasiconformal flattening maps for multiply connected open surfaces. In conventional …

In this paper, we are concerned with the problem of creating flattening maps of simply
connected open surfaces in R^3. Using a natural principle of density diffusion in physics, we …

Abstract Integer Grid Maps (IGMs) are a class of mappings characterized by integer isolines
that align up to unit translations and rotations of multiples of 90 degrees. They are widely …

Given a set of corresponding user-specified anchor points on a pair of models having similar
features and topologies, the cross parameterization technique can establish a bijective …