The POP Buffer: Rapid Progressive Clustering by Geometry Quantization
M. Limper, Y. Jung, J. Behr, M. Alexa
In Computer Graphics Forum, 32(7), 2013.
Abstract: Within this paper, we present a novel, straightforward progressive encoding scheme for general triangle soups, which is particularly well-suited for mobile and Web-based environments due to its minimal requirements on the client's hardware and software. Our rapid encoding method uses a hierarchy of quantization to effectively reorder the original primitive data into several nested levels of detail. The resulting stateless buffer can progressively be transferred as-is to the GPU, where clustering is efficiently performed in parallel during rendering. We combine our approach with a crack-free mesh partitioning scheme to obtain a straightforward method for fast streaming and basic view-dependent LOD control.
Article URL: http://dx.doi.org/10.1111/cgf.12227
BibTeX format:
@article{Limper:2013:TPB,
  author = {M. Limper and Y. Jung and J. Behr and M. Alexa},
  title = {The POP Buffer: Rapid Progressive Clustering by Geometry Quantization},
  journal = {Computer Graphics Forum},
  volume = {32},
  number = {7},
  pages = {197--206},
  year = {2013},
}
Search for more articles by M. Limper.
Search for more articles by Y. Jung.
Search for more articles by J. Behr.
Search for more articles by M. Alexa.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."