Sciweavers

3025 search results - page 383 / 605
» Computational geometry: a retrospective
Sort
View
333
Voted
COMPGEOM
2011
ACM
14 years 10 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
193
Voted
COCOA
2009
Springer
15 years 10 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
CVPR
2000
IEEE
16 years 9 months ago
Reconstruction from Six-Point Sequences
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
Richard I. Hartley, Nicolas Y. Dano
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Printed Patterns for Enhanced Shape Perception of Papercraft Models
Papercraft models can serve as inexpensive prototypes in shape design applications. However, in making the models some geometric detail is necessarily lost, and artificial crease...
Su Xue, Xuejin Chen, Julie Dorsey, Holly Rushmeier
SI3D
2009
ACM
16 years 1 months ago
Approximating dynamic global illumination in image space
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...
Tobias Ritschel, Thorsten Grosch, Hans-Peter Seide...