@TECHREPORT{Gumhold-2004-PPM,
   AUTHOR = {Stefan Gumhold},
   INSTITUTION = {Wilhelm-Schickard-Institut f{\"u}r Informatik, University of T{\"u}bingen, Germany},
   NUMBER = {WSI-2004-4},
   AFFILIATIONS = {CGV,GRIS},
   AREAS = {GP},
   TITLE = {Progressive Polygonal Meshes},
   URL = {http://tu-dresden.de/die_tu_dresden/fakultaeten/fakultaet_informatik/smt/cgv/publikationen/2004/ppm/ppmTR.pdf},
   YEAR = {2004},
   KEYWORDS = {GRIS},
   ABSTRACT = {In this work we build a progressive polygonal mesh based on face clustering. The basic
	  simplification operations are the edge-removal and the edge-join operations. There is no need to
	  tessellate non-triangular models as the proposed representation is fully polygonal. We investigate
	  three different error measures to build the progressive representation based on a priority queue
	  based face clustering algorithm.
	  The progressive polygonal mesh representation is built with the inverse refinement operations
	  - the edge-insert and edge-split operations, which can be implemented very efficiently within a
	  newly proposed half-edge data structure. We suggest a progressive file format that allows to read a
	  polygonal model faster than with the standard binary file formats. Finally, we extend the proposed
	  half-edge data structure to a progressive representation that does not consume any further storage
	  space and allows for very fast changes in the mesh resolution.}
}

{"_id":{"_str":"534268370e946d920a000e95"},"__v":1,"authorIDs":["545772172abc8e9f370003e4"],"author_short":["Gumhold, S."],"bibbaseid":"gumhold-progressivepolygonalmeshes-2004","bibdata":{"bibtype":"techreport","type":"techreport","author":[{"firstnames":["Stefan"],"propositions":[],"lastnames":["Gumhold"],"suffixes":[]}],"institution":"Wilhelm-Schickard-Institut für Informatik, University of Tübingen, Germany","number":"WSI-2004-4","affiliations":"CGV,GRIS","areas":"GP","title":"Progressive Polygonal Meshes","url":"http://tu-dresden.de/die_tu_dresden/fakultaeten/fakultaet_informatik/smt/cgv/publikationen/2004/ppm/ppmTR.pdf","year":"2004","keywords":"GRIS","abstract":"In this work we build a progressive polygonal mesh based on face clustering. The basic simplification operations are the edge-removal and the edge-join operations. There is no need to tessellate non-triangular models as the proposed representation is fully polygonal. We investigate three different error measures to build the progressive representation based on a priority queue based face clustering algorithm. The progressive polygonal mesh representation is built with the inverse refinement operations - the edge-insert and edge-split operations, which can be implemented very efficiently within a newly proposed half-edge data structure. We suggest a progressive file format that allows to read a polygonal model faster than with the standard binary file formats. Finally, we extend the proposed half-edge data structure to a progressive representation that does not consume any further storage space and allows for very fast changes in the mesh resolution.","bibtex":"@TECHREPORT{Gumhold-2004-PPM,\n AUTHOR = {Stefan Gumhold},\n INSTITUTION = {Wilhelm-Schickard-Institut f{\\\"u}r Informatik, University of T{\\\"u}bingen, Germany},\n NUMBER = {WSI-2004-4},\n AFFILIATIONS = {CGV,GRIS},\n AREAS = {GP},\n TITLE = {Progressive Polygonal Meshes},\n URL = {http://tu-dresden.de/die_tu_dresden/fakultaeten/fakultaet_informatik/smt/cgv/publikationen/2004/ppm/ppmTR.pdf},\n YEAR = {2004},\n KEYWORDS = {GRIS},\n ABSTRACT = {In this work we build a progressive polygonal mesh based on face clustering. The basic\n\t simplification operations are the edge-removal and the edge-join operations. There is no need to\n\t tessellate non-triangular models as the proposed representation is fully polygonal. We investigate\n\t three different error measures to build the progressive representation based on a priority queue\n\t based face clustering algorithm.\n\t The progressive polygonal mesh representation is built with the inverse refinement operations\n\t - the edge-insert and edge-split operations, which can be implemented very efficiently within a\n\t newly proposed half-edge data structure. We suggest a progressive file format that allows to read a\n\t polygonal model faster than with the standard binary file formats. Finally, we extend the proposed\n\t half-edge data structure to a progressive representation that does not consume any further storage\n\t space and allows for very fast changes in the mesh resolution.}\n}\n\n\n","author_short":["Gumhold, S."],"key":"Gumhold-2004-PPM","id":"Gumhold-2004-PPM","bibbaseid":"gumhold-progressivepolygonalmeshes-2004","role":"author","urls":{"Paper":"http://tu-dresden.de/die_tu_dresden/fakultaeten/fakultaet_informatik/smt/cgv/publikationen/2004/ppm/ppmTR.pdf"},"keyword":["GRIS"],"downloads":2},"bibtype":"techreport","biburl":"http://tu-dresden.de/die_tu_dresden/fakultaeten/fakultaet_informatik/smt/cgv/publikationen/cgv.bib","downloads":2,"keywords":["gris"],"search_terms":["progressive","polygonal","meshes","gumhold"],"title":"Progressive Polygonal Meshes","year":2004,"dataSources":["vQwWsgZnTc3YpyrC3"]}