Sciweavers

102291 search results - page 352 / 20459
» Computability in Computational Geometry
Sort
View
CGF
2011
14 years 10 months ago
Procedural Modeling of Interconnected Structures
The complexity and detail of geometric scenes that are used in today’s computer animated films and interactive games have reached a level where the manual creation by tradition...
Lars Krecklau, Leif Kobbelt
SMA
2003
ACM
115views Solid Modeling» more  SMA 2003»
16 years 18 hour ago
Estimating the in/out function of a surface represented by points
We present a method to estimate the in/out function of a closed surface represented by an unorganized set of data points. From the in/out function, we compute an approximation of ...
Vinícius Mello, Luiz Velho, Gabriel Taubin
SGP
2004
15 years 9 months ago
Spectral Surface Reconstruction From Noisy Point Clouds
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
Ravi Krishna Kolluri, Jonathan Richard Shewchuk, J...
ECCV
2002
Springer
16 years 8 months ago
All the Images of an Outdoor Scene
The appearance of an outdoor scene depends on a variety of factors such as viewing geometry, scene structure and reflectance (BRDF or BTF), illumination (sun, moon, stars, street l...
Srinivasa G. Narasimhan, Chi Wang, Shree K. Nayar
COMPGEOM
1992
ACM
15 years 11 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
« Prev « First page 352 / 20459 Last » Next »