Sciweavers

839 search results - page 78 / 168
» Three-Clustering of Points in the Plane
Sort
View
SIGGRAPH
2010
ACM
14 years 2 months ago
Line space gathering for single scattering in large scenes
We present an efficient technique to render single scattering in large scenes with reflective and refractive objects and homogeneous participating media. Efficiency is obtained...
Xin Sun, Kun Zhou, Stephen Lin, Baining Guo
CATS
2007
13 years 11 months ago
Constructing Optimal Highways
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the ...
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Ba...
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 11 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
CVPR
2001
IEEE
15 years 8 days ago
Issues on the Geometry of Central Catadioptric Image Formation
An imaging system with a single effective viewpoint is called a central projection system. The conventional perspective camera is an example of a central projection system. System...
João P. Barreto, Helder Araújo
ECCV
2006
Springer
15 years 4 days ago
Level-Set Curve Particles
In many applications it is necessary to track a moving and deforming boundary on the plane from infrequent, sparse measurements. For instance, each of a set of mobile observers may...
Tingting Jiang, Carlo Tomasi