102291 search results - page 290 / 20459 » Computability in Computational Geometry |
170
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
Artists and illustrators can evoke the complexity of fur or vegetation with relatively few well-placed strokes. We present an algorithm that uses strokes to render 3D computer gra...
180
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...
181
click to vote
SIGGRAPH
1993
ACM
15 years 10 months ago
1993
ACM
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
163
click to vote
IMR
2004
Springer
16 years 16 hour ago
2004
Springer
We present several mesh smoothing schemes based on the concept of optimal Delaunay triangulations. We define the optimal Delaunay triangulation (ODT) as the triangulation that mi...
190
click to vote
IMR
2004
Springer
16 years 16 hour ago
2004
Springer
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...