Sciweavers

2081 search results - page 339 / 417
» L-systems in Geometric Modeling
Sort
View
116
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
SIGGRAPH
1997
ACM
15 years 4 months ago
Metropolis light transport
We present a new Monte Carlo method for solving the light transport problem, inspired by the Metropolis sampling method in computational physics. To render an image, we generate a...
Eric Veach, Leonidas J. Guibas
122
Voted
SIGGRAPH
1993
ACM
15 years 4 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
SIGGRAPH
1992
ACM
15 years 4 months ago
Interactive inspection of solids: cross-sections and interferences
To reduce the cost of correcting design errors, assemblies of mechanical parts are modeled using CAD systems and verified electronically before the designs are sent to manufacturi...
Jarek Rossignac, Abe Megahed, Bengt-Olaf Schneider
108
Voted
COMPGEOM
2010
ACM
15 years 4 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh