Sciweavers

134 search results - page 22 / 27
» Computing Polygonal Surfaces from Unions of Balls
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
Implicit Blending Revisited
Blending is both the strength and the weakness of functionally based implicit surfaces (such as F-reps or softobjects). While it gives them the unique ability to smoothly merge in...
Adrien Bernhardt, Loic Barthe, Marie-Paule Cani, B...
PG
2007
IEEE
14 years 1 months ago
Exact Evaluation of Non-Polynomial Subdivision Schemes at Rational Parameter Values
In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision on a uniform grid of any size. Other exact evaluation technique either restrict t...
Scott Schaefer, Joe D. Warren
CGA
2000
13 years 7 months ago
Metamorphosis of Arbitrary Triangular Meshes
Recently, animations with deforming objects have been frequently used in various computer graphics applications. Metamorphosis (or morphing) of three-dimensional objects is one of...
Takashi Kanai, Hiromasa Suzuki, Fumihiko Kimura
CGF
2011
12 years 11 months ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt
SIGGRAPH
1993
ACM
13 years 11 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan