Sciweavers

397 search results - page 24 / 80
» Geometrical plenoptic sampling
Sort
View
CGF
2008
227views more  CGF 2008»
15 years 1 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
WEA
2010
Springer
311views Algorithms» more  WEA 2010»
15 years 8 months ago
Geometric Minimum Spanning Trees with GeoFilterKruskal
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
Samidh Chatterjee, Michael Connor, Piyush Kumar
JCAMD
2010
65views more  JCAMD 2010»
15 years 7 days ago
Analysis of SM8 and Zap TK calculations and their geometric sensitivity
Abstract A prospective study of aqueous solvation energies was done using the SM8 and Zap TK models for a variety of geometries. CM4M charges calculated with M06 and M06-2X were fo...
Benjamin A. Ellingson, A. Geoffrey Skillman, Antho...
ICIP
2005
IEEE
16 years 3 months ago
Curvature-based adaptive remeshing for wavelet-based multiresolution 3D meshes
Most of the meshes coming from a variety of source are over sampled and exhibit highly irregular connectivity that prevent efficient wavelet analysis. Remeshing comes as a solutio...
Alexandre Gouaillard, Arnaud Gelas, Eric Boix, R&e...
CCCG
2006
15 years 3 months ago
Polygon Reconstruction from Line Cross-Sections
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
Gill Barequet, Craig Gotsman, Avishay Sidlesky