The present authors have introduced polynomial splines over T-meshes (PHT-splines) and provided the theories and applications for PHT-splines over hierarchical T-meshes. This paper generalizes PHT-splines to arbitrary topology over general T-meshes with any structures. The general PHT-spline surfaces can be constructed through an unified scheme to interpolate the local geometric information at ...

Adaptive meshes are dynamic networks of nodal masses interconnected by adjustable springs. They are useful for nonuniformly sampling and reconstructing visual data. This paper extends the adaptive mesh model in the following ways: it (i) develops open adaptive meshes and closed adaptive shells based on triangular and rectangular elements, (ii) proposes a discontinuity detection and preservation...

-Representation of video objects using hierarchical 2D content-based meshes for accurate tracking and level of detail (LOD) rendering have been previously proposed, where a simple suboptimal hierarchical mesh design algorithm was employed. However, it was concluded that the performance of the tracking and rendering very much depends on how well each level of the hierarchical mesh structure fits...

We propose a method for calculating deformations of models by deforming a low-resolution mesh and adding details while ensuring that the details we add satisfy a set of constraints. Our method builds a low-resolution representation of a mesh by using edge collapses and performs an as-rigid-as-possible deformation on the simplified mesh. We then add back details by reversing edge-collapses so th...

1 Introduction

In this paper, we present an algorithm for efficient encoding of triangle meshes. The algorithm preserves the local relations between vertices by encoding their Laplacian coordinates, while at the same time, it uses a hierarchy of additional vertex constraints that provides global rigidity and low absolute error, even for large meshes. Our scheme outperforms traversal based as well as Laplacian...

Current alignment algorithms for registering range data captured from a 3D scanner assume that the range data depicts identical geometry taken from different views. However, in the presence of scanner calibration errors, the data will be slightly warped. These warps often cause current alignment algorithms to converge slowly, find the wrong alignment, or even diverge. In this paper, we present ...

Path-finding can become an important bottleneck as both the size of the virtual environments and the number of agents navigating them increase. It is important to develop techniques that can be efficiently applied to any environment independently of its abstract representation. In this paper we present a hierarchical NavMesh representation to speed up path-finding. Hierarchical path-finding (HP...