Sciweavers

727 search results - page 30 / 146
» One line and n points
Sort
View
96
Voted
SIGGRAPH
2010
ACM
15 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
JCSS
2011
95views more  JCSS 2011»
14 years 4 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger
67
Voted
COMPGEOM
2008
ACM
14 years 11 months ago
Consistent digital rays
Given a fixed origin o in the d-dimensional grid, we give a novel definition of digital rays dig(op) from o to each grid point p. Each digital ray dig(op) approximates the Euclide...
Jinhee Chun, Matias Korman, Martin Nöllenburg...
CPM
1997
Springer
87views Combinatorics» more  CPM 1997»
15 years 2 months ago
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs
We show an ecient pattern matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operati...
Masamichi Miyazaki, Ayumi Shinohara, Masayuki Take...
CCCG
2007
14 years 11 months ago
Covering Points by Isothetic Unit Squares
Given a set P of n points in R2 , we consider two related problems. Firstly, we study the problem of computing two isothetic unit squares which may be either disjoint or intersect...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...