Selecting rank-1 lattices with respect to maximized mutual minimum distance has been shown to be very useful for image representation and synthesis in computer graphics. While algorithms using rank-1 lattices are very simple and efficient, the selection of their generator vectors often has to resort to exhaustive computer searches, which is prohibitively slow. For the two-dimensional setting, we introduce an efficient approximate search algorithm and transfer the principle to the search for maximum minimum distance rank-1 lattice sequences. We then extend the search for rank-1 lattices to approximate a given spectrum and present new algorithms for anti-aliasing and texture representation in computer graphics. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Dammertz, S., Dammertz, H., & Keller, A. (2009). Efficient search for two-dimensional rank-1 lattices with applications in graphics. In Monte Carlo and Quasi-Monte Carlo Methods 2008 (pp. 271–287). Springer Verlag. https://doi.org/10.1007/978-3-642-04107-5_16
Mendeley helps you to discover research relevant for your work.