Sainz, MiguelPajarola, RenatoLario, RobertoMarkus Gross and Hanspeter Pfister and Marc Alexa and Szymon Rusinkiewicz2014-01-292014-01-2920043-905673-09-61811-7813http://dx.doi.org/10.2312/SPBG/SPBG04/121-128The increasing popularity of points as rendering primitives has led to a variety of different rendering algorithms, and in particular the different implementations compare like apples to oranges. In this paper we revisit a number of recently developed point-based rendering implementations. We briefly summarize a few proposed hierarchical multiresolution point data structures and their advantages. Based on a common multiresolution framework we then describe and examine different hardware accelerated point rendering algorithms. Experimental results are given with respect to performance timing and rendering quality for the different approaches.Categories and Subject Descriptiors (according to ACM CCS): I.3 Computer Graphics, I.3.5 Computational Geometry and Object Modeling, I.3.6 Methodology and Techniques