Time-critical rendering of irregular grids

Ricardo Farias, Joseph S B Mitchell, Cláudio T. Silva, Brian Wylie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Many papers have presented rendering techniques and simplification ideas with the objective of speeding up image generation for irregular grid data sets. For large data sets, however, even the current fastest algorithms are known to require seconds to generate each image, making real-time analysis of such data sets very difficult, or even impossible, unless one has access to powerful and expensive computer hardware. In order to synthesize a system for handling very large data sets analysis, we have assembled algorithms for rendering, simplification and triangulation, and added to them some optimizations. We have made some improvements on one of the best current algorithms for rendering irregular grids, and added to it some simple approximation methods in both image and object space, resulting in a system that achieves high frame rates, even on slow computers without any specific graphic hardware. The algorithm adapts itself to the time budget it has available for each image generation, using hierarchical representations of the mesh for faster delivery of images when transformations are imposed to the data. When given additional time, the algorithm generates finer images, obtaining the precise final image if given sufficient time. We were able to obtain frame rates of the order of 5Hz for medium-sized data sets, which is about 20 times faster than previous rendering algorithms. With a trade-off between image accuracy and speed, similar frame rates can be achieved on different computers.

Original languageEnglish (US)
Title of host publicationProceedings - 13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000
PublisherIEEE Computer Society
Pages243-250
Number of pages8
Volume2000-January
ISBN (Print)0769508782
DOIs
StatePublished - 2000
Event13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000 - Gramado, Brazil
Duration: Oct 17 2000Oct 20 2000

Other

Other13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000
CountryBrazil
CityGramado
Period10/17/0010/20/00

Fingerprint

Computer hardware
Triangulation

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Signal Processing
  • Software

Cite this

Farias, R., Mitchell, J. S. B., Silva, C. T., & Wylie, B. (2000). Time-critical rendering of irregular grids. In Proceedings - 13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000 (Vol. 2000-January, pp. 243-250). [883919] IEEE Computer Society. https://doi.org/10.1109/SIBGRA.2000.883919

Time-critical rendering of irregular grids. / Farias, Ricardo; Mitchell, Joseph S B; Silva, Cláudio T.; Wylie, Brian.

Proceedings - 13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000. Vol. 2000-January IEEE Computer Society, 2000. p. 243-250 883919.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Farias, R, Mitchell, JSB, Silva, CT & Wylie, B 2000, Time-critical rendering of irregular grids. in Proceedings - 13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000. vol. 2000-January, 883919, IEEE Computer Society, pp. 243-250, 13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000, Gramado, Brazil, 10/17/00. https://doi.org/10.1109/SIBGRA.2000.883919
Farias R, Mitchell JSB, Silva CT, Wylie B. Time-critical rendering of irregular grids. In Proceedings - 13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000. Vol. 2000-January. IEEE Computer Society. 2000. p. 243-250. 883919 https://doi.org/10.1109/SIBGRA.2000.883919
Farias, Ricardo ; Mitchell, Joseph S B ; Silva, Cláudio T. ; Wylie, Brian. / Time-critical rendering of irregular grids. Proceedings - 13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000. Vol. 2000-January IEEE Computer Society, 2000. pp. 243-250
@inproceedings{2e0ddca00c154ac9be71d15b18c431b2,
title = "Time-critical rendering of irregular grids",
abstract = "Many papers have presented rendering techniques and simplification ideas with the objective of speeding up image generation for irregular grid data sets. For large data sets, however, even the current fastest algorithms are known to require seconds to generate each image, making real-time analysis of such data sets very difficult, or even impossible, unless one has access to powerful and expensive computer hardware. In order to synthesize a system for handling very large data sets analysis, we have assembled algorithms for rendering, simplification and triangulation, and added to them some optimizations. We have made some improvements on one of the best current algorithms for rendering irregular grids, and added to it some simple approximation methods in both image and object space, resulting in a system that achieves high frame rates, even on slow computers without any specific graphic hardware. The algorithm adapts itself to the time budget it has available for each image generation, using hierarchical representations of the mesh for faster delivery of images when transformations are imposed to the data. When given additional time, the algorithm generates finer images, obtaining the precise final image if given sufficient time. We were able to obtain frame rates of the order of 5Hz for medium-sized data sets, which is about 20 times faster than previous rendering algorithms. With a trade-off between image accuracy and speed, similar frame rates can be achieved on different computers.",
author = "Ricardo Farias and Mitchell, {Joseph S B} and Silva, {Cl{\'a}udio T.} and Brian Wylie",
year = "2000",
doi = "10.1109/SIBGRA.2000.883919",
language = "English (US)",
isbn = "0769508782",
volume = "2000-January",
pages = "243--250",
booktitle = "Proceedings - 13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Time-critical rendering of irregular grids

AU - Farias, Ricardo

AU - Mitchell, Joseph S B

AU - Silva, Cláudio T.

AU - Wylie, Brian

PY - 2000

Y1 - 2000

N2 - Many papers have presented rendering techniques and simplification ideas with the objective of speeding up image generation for irregular grid data sets. For large data sets, however, even the current fastest algorithms are known to require seconds to generate each image, making real-time analysis of such data sets very difficult, or even impossible, unless one has access to powerful and expensive computer hardware. In order to synthesize a system for handling very large data sets analysis, we have assembled algorithms for rendering, simplification and triangulation, and added to them some optimizations. We have made some improvements on one of the best current algorithms for rendering irregular grids, and added to it some simple approximation methods in both image and object space, resulting in a system that achieves high frame rates, even on slow computers without any specific graphic hardware. The algorithm adapts itself to the time budget it has available for each image generation, using hierarchical representations of the mesh for faster delivery of images when transformations are imposed to the data. When given additional time, the algorithm generates finer images, obtaining the precise final image if given sufficient time. We were able to obtain frame rates of the order of 5Hz for medium-sized data sets, which is about 20 times faster than previous rendering algorithms. With a trade-off between image accuracy and speed, similar frame rates can be achieved on different computers.

AB - Many papers have presented rendering techniques and simplification ideas with the objective of speeding up image generation for irregular grid data sets. For large data sets, however, even the current fastest algorithms are known to require seconds to generate each image, making real-time analysis of such data sets very difficult, or even impossible, unless one has access to powerful and expensive computer hardware. In order to synthesize a system for handling very large data sets analysis, we have assembled algorithms for rendering, simplification and triangulation, and added to them some optimizations. We have made some improvements on one of the best current algorithms for rendering irregular grids, and added to it some simple approximation methods in both image and object space, resulting in a system that achieves high frame rates, even on slow computers without any specific graphic hardware. The algorithm adapts itself to the time budget it has available for each image generation, using hierarchical representations of the mesh for faster delivery of images when transformations are imposed to the data. When given additional time, the algorithm generates finer images, obtaining the precise final image if given sufficient time. We were able to obtain frame rates of the order of 5Hz for medium-sized data sets, which is about 20 times faster than previous rendering algorithms. With a trade-off between image accuracy and speed, similar frame rates can be achieved on different computers.

UR - http://www.scopus.com/inward/record.url?scp=84949956015&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949956015&partnerID=8YFLogxK

U2 - 10.1109/SIBGRA.2000.883919

DO - 10.1109/SIBGRA.2000.883919

M3 - Conference contribution

SN - 0769508782

VL - 2000-January

SP - 243

EP - 250

BT - Proceedings - 13th Brazilian Symposium on Computer Graphics and Image Processing, SIBGRAPI 2000

PB - IEEE Computer Society

ER -