Sciweavers

91 search results - page 5 / 19
» On random points in the unit disk
Sort
View
COCOON
2007
Springer
14 years 16 days ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan
JGTOOLS
2006
72views more  JGTOOLS 2006»
13 years 8 months ago
Efficient Generation of Poisson-Disk Sampling Patterns
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and ot...
Thouis R. Jones
SIAMCOMP
2008
137views more  SIAMCOMP 2008»
13 years 8 months ago
Approximate Shortest Paths in Anisotropic Regions
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Ya...
CASES
2009
ACM
14 years 3 months ago
A buffer replacement algorithm exploiting multi-chip parallelism in solid state disks
Solid State Disks (SSDs) are superior to magnetic disks from a performance point of view due to the favorable features of NAND flash memory. Furthermore, thanks to improvement on...
Jinho Seol, Hyotaek Shim, Jaegeuk Kim, Seungryoul ...
RSA
2011
85views more  RSA 2011»
13 years 3 months ago
Piercing random boxes
Abstract. Consider a set of n random axis parallel boxes in the unit hypercube in Rd , where d is fixed and n tends to infinity. We show that the minimum number of points one nee...
Linh V. Tran