Progressive Forest Split. Furht, B., editor In Encyclopedia of Multimedia, pages 737–738. Springer US, 2008. 00000![Progressive Forest Split [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex DefinitionProgressive Forest Split is an efficient encoding technique for a simple polygon; it groups the decimations into a batch to achieve a high compression ratio.PFS (Progressive Forest Split) [1] is much more efficient in encoding at the expense of looser granularity. Similar to CPM (Compressed Progressive Meshes) [2], it groups the decimations into a batch to achieve a high compression ratio. PFS cuts the mesh through the forest edges, triangulates each tree boundary loop, and displaces vertices to new positions. The geometric data contains the error between the predicted and the real vertex positions. The amortized connectivity encoding takes 10 bits and geometry encoding takes 30 bits per vertex. MPEG-4 accepts PFS as the standard compression scheme. However, PFS is not widely implemented in current 3D players [3].PFS provides an efficient encoding for a simple polygon (triangulated with no internal vertices). For each refinement, at compression, certain simple polyg ...
@incollection{furht_progressive_2008,
title = {Progressive {Forest} {Split}},
copyright = {©2008 Springer-Verlag},
isbn = {978-0-387-74724-8 978-0-387-78414-4},
url = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_185},
abstract = {DefinitionProgressive Forest Split is an efficient encoding technique for a simple polygon; it groups the decimations into a batch to achieve a high compression ratio.PFS (Progressive Forest Split) [1] is much more efficient in encoding at the expense of looser granularity. Similar to CPM (Compressed Progressive Meshes) [2], it groups the decimations into a batch to achieve a high compression ratio. PFS cuts the mesh through the forest edges, triangulates each tree boundary loop, and displaces vertices to new positions. The geometric data contains the error between the predicted and the real vertex positions. The amortized connectivity encoding takes 10 bits and geometry encoding takes 30 bits per vertex. MPEG-4 accepts PFS as the standard compression scheme. However, PFS is not widely implemented in current 3D players [3].PFS provides an efficient encoding for a simple polygon (triangulated with no internal vertices). For each refinement, at compression, certain simple polyg ...},
language = {en},
urldate = {2016-05-03},
booktitle = {Encyclopedia of {Multimedia}},
publisher = {Springer US},
editor = {Furht, Borko},
year = {2008},
note = {00000},
pages = {737--738}
}
Downloads: 0
{"_id":"386XSdY4kYhLmfrMp","bibbaseid":"furht-progressiveforestsplit-2008","authorIDs":[],"bibdata":{"bibtype":"incollection","type":"incollection","title":"Progressive Forest Split","copyright":"©2008 Springer-Verlag","isbn":"978-0-387-74724-8 978-0-387-78414-4","url":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_185","abstract":"DefinitionProgressive Forest Split is an efficient encoding technique for a simple polygon; it groups the decimations into a batch to achieve a high compression ratio.PFS (Progressive Forest Split) [1] is much more efficient in encoding at the expense of looser granularity. Similar to CPM (Compressed Progressive Meshes) [2], it groups the decimations into a batch to achieve a high compression ratio. PFS cuts the mesh through the forest edges, triangulates each tree boundary loop, and displaces vertices to new positions. The geometric data contains the error between the predicted and the real vertex positions. The amortized connectivity encoding takes 10 bits and geometry encoding takes 30 bits per vertex. MPEG-4 accepts PFS as the standard compression scheme. However, PFS is not widely implemented in current 3D players [3].PFS provides an efficient encoding for a simple polygon (triangulated with no internal vertices). For each refinement, at compression, certain simple polyg ...","language":"en","urldate":"2016-05-03","booktitle":"Encyclopedia of Multimedia","publisher":"Springer US","editor":[{"propositions":[],"lastnames":["Furht"],"firstnames":["Borko"],"suffixes":[]}],"year":"2008","note":"00000","pages":"737–738","bibtex":"@incollection{furht_progressive_2008,\n\ttitle = {Progressive {Forest} {Split}},\n\tcopyright = {©2008 Springer-Verlag},\n\tisbn = {978-0-387-74724-8 978-0-387-78414-4},\n\turl = {http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_185},\n\tabstract = {DefinitionProgressive Forest Split is an efficient encoding technique for a simple polygon; it groups the decimations into a batch to achieve a high compression ratio.PFS (Progressive Forest Split) [1] is much more efficient in encoding at the expense of looser granularity. Similar to CPM (Compressed Progressive Meshes) [2], it groups the decimations into a batch to achieve a high compression ratio. PFS cuts the mesh through the forest edges, triangulates each tree boundary loop, and displaces vertices to new positions. The geometric data contains the error between the predicted and the real vertex positions. The amortized connectivity encoding takes 10 bits and geometry encoding takes 30 bits per vertex. MPEG-4 accepts PFS as the standard compression scheme. However, PFS is not widely implemented in current 3D players [3].PFS provides an efficient encoding for a simple polygon (triangulated with no internal vertices). For each refinement, at compression, certain simple polyg ...},\n\tlanguage = {en},\n\turldate = {2016-05-03},\n\tbooktitle = {Encyclopedia of {Multimedia}},\n\tpublisher = {Springer US},\n\teditor = {Furht, Borko},\n\tyear = {2008},\n\tnote = {00000},\n\tpages = {737--738}\n}\n\n","editor_short":["Furht, B."],"key":"furht_progressive_2008","id":"furht_progressive_2008","bibbaseid":"furht-progressiveforestsplit-2008","role":"editor","urls":{"Paper":"http://link.springer.com/referenceworkentry/10.1007/978-0-387-78414-4_185"},"downloads":0,"html":""},"bibtype":"incollection","biburl":"http://www.telemidia.puc-rio.br/~alan/files/all.bib","creationDate":"2020-03-03T14:08:14.141Z","downloads":0,"keywords":[],"search_terms":["progressive","forest","split"],"title":"Progressive Forest Split","year":2008,"dataSources":["jAxurbvLP8q5LTdLa"]}