Sciweavers

264 search results - page 6 / 53
» Sample Sort on Meshes
Sort
View
RT
1997
Springer
13 years 11 months ago
Incremental Updates to Scenes Illuminated by Area Light Sources
Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...
Yiorgos Chrysanthou, Mel Slater
EDUTAINMENT
2006
Springer
13 years 11 months ago
Generating 3D Paper-Cutting Effects
In this paper we describe a framework for generating 3D paper-cutting effects on mesh models. The framework involves the construction of model defined paper-cutting patterns, extr...
Yan Li, Jinhui Yu, Honxin Zhang, Jiaoying Shi
VMV
2004
185views Visualization» more  VMV 2004»
13 years 8 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
PG
1999
IEEE
13 years 11 months ago
Mesh Approximation Using a Volume-Based Metric
In this paper we introduce a mesh approximation method that uses a volume-based metric. After a geometric simplification, we minimize the volume between the simplified mesh and th...
Pierre Alliez, Nathalie Laurent, Henri Sanson, Fra...
IPPS
1998
IEEE
13 years 11 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman