Now showing items 1-20 of 52

• #### 3D Deformation Using Moving Least Squares ﻿

(2007)
We present a 3d deformation method based on Moving Least Squares that extends the work by Schaefer et al. [Schaefer et al. 2006] to the 3d setting. The user controls the deformation by manipulating a set of point handles. ...
• #### Arc-Length Compression ﻿

(2003)
We introduce a novel method for lossy compression of the two-dimensional curves based on the arc-length parameterization. We show that the proposed method has a number of advantages: it is progressive, converges uniformly, ...
• #### An As-Rigid-As-Possible Approach to Sensor Network Localization ﻿

(2009)
We present a novel approach to localization of sensors in a network given a subset of noisy inter-sensor distances. The algorithm is based on "stitching" together local structures by solving an optimization problem requiring ...
• #### Characterizing generic global rigidity ﻿

(Johns Hopkins University Press, 2010)
A d-dimensional framework is a graph and a map from its vertices to E^d. Such a framework is globally rigid if it is the only framework in E^d with the same graph and edge lengths, up to rigid motions. For which underlying ...
• #### Discontinuity Edge Overdraw ﻿

(Association for Computing Machinery, 2001)
Aliasing is an important problem when rendering triangle meshes. Efficient antialiasing techniques such as mipmapping greatly improve the filtering of textures defined over a mesh. A major component of the remaining aliasing ...
• #### Discrete One-forms on Meshes and Applications to 3D mesh Parameterization ﻿

(Elsevier, 2006)
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an easy proof of Tutte's celebrated “spring-embedding” ...
• #### Dynamically Reparameterized Light Fields ﻿

(Association for Computing Machinery, 2000)
This research further develops the light field and lumigraph image-based rendering methods and extends their utility. We present alternate parameterizations that permit 1) interactive rendering of moderately sampled light ...
• #### Fast exact and approximate geodesics on meshes ﻿

(Association for Computing Machinery, 2005)
The computation of geodesic paths and distances on triangle meshes is a common operation in many computer graphics applications. We present several practical algorithms for computing such geodesics from a source point to ...
• #### Feature-based cellular texturing for architectural models ﻿

(Association for Computing Machinery, 2001)
Cellular patterns are all around us, in masonry, tiling, shingles, and many other materials. Such patterns, especially in architectural settings, are influenced by geometric features of the underlying shape. Bricks turn ...

(2016)
• #### Focal surfaces of discrete geometry ﻿

(Eurographics Association/ Association for Computing Machinery, 2007)
The differential geometry of smooth three-dimensional surfaces can be interpreted from one of two perspectives: in terms of oriented frames located on the surface, or in terms of a pair of associated focal surfaces. These ...
• #### Free-boundary Linear Parameterization of 3D Meshes in the Presence of Constraints ﻿

(Institute of Electrical and Electronics Engineers (IEEE), 2005)
Linear parameterization of 3D meshes with disk topology is usually performed using the method of barycentric coordinates pioneered by Tutte and Floater. This imposes a convex boundary on the parameterization which can ...
• #### Generalized Multi-Camera Scene Reconstruction Using Graph Cuts ﻿

(Springer, 2003)
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are visible from all cameras. In the last few ...
• #### Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces ﻿

(Springer, 2014)
In this paper we study the property of generic global rigidity for frameworks of graphs embedded in d-dimensional complex space and in a d-dimensional pseudo-Euclidean space R$^{2}$ with a metric of indefinite signature). ...
• #### A geometrical approach to computing free-energy landscapes from short-ranged potentials ﻿

(Proceedings of the National Academy of Sciences, 2012)
Particles interacting with short-ranged potentials have attracted increasing interest, partly for their ability to model mesoscale systems such as colloids interacting via DNA or depletion. We consider the free-energy ...
• #### Geometry images ﻿

(Association for Computing Machinery, 2002)
Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, which has advantages for many graphics ...
• #### Geometry videos ﻿

(Eurographics Association, 2003)
We present the "Geometry Video," a new data structure to encode animated meshes. Being able to encode animated meshes in a generic source-independent format allows people to share experiences. Changing the viewpoint allows ...
• #### Hierarchical and Variational Geometric Modeling with Wavelets ﻿

(Association for Computing Machinery, 1995)
This paper discusses how wavelet techniques may be applied to a variety of geometric modeling tools. In particular, wavelet decompositions are shown to be useful for hierarchical control point or least squares editing. In ...
• #### Hierarchical spacetime control ﻿

(Association for Computing Machinery, 1994)
Specifying the motion of an animated linked figure such that it achieves given tasks (e.g., throwing a ball into a basket) and performs the tasks in a realistic fashion (e.g., gracefully, and following physical laws such ...
• #### Image-Based Visual Hulls ﻿

(Association for Computing Machinery, 2000)
In this paper, we describe an efficient image-based approach to computing and shading visual hulls from silhouette image data. Our algorithm takes advantage of epipolar geometry and incremental computation to achieve a ...