A memory insensitive technique for large model simplification

P. Lindstrom, C. T. Silva

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

Abstract

In this paper we propose three simple, but significant improvements to the OoCS (Out-of-Core Simplification) algorithm of Lindstrom which increase the quality of approximations and extend the applicability of the algorithm to an even larger class of compute systems. The original OoCS algorithm has memory complexity that depends on the size of the output mesh, but no dependency on the size of the input mesh. That is, it can be used to simplify meshes of arbitrarily large size, but the complexity of the output mesh is limited by the amount of memory available. Our first contribution is a version of OoCS that removes the dependency of having enough memory to hold (even) the simplified mesh. With our new algorithm, the whole process is made essentially independent of the available memory on the host computer. Our new technique uses disk instead of main memory, but it is carefully designed to avoid costly random accesses. Our two other contributions improve the quality of the approximations generated by OoCS. We propose a scheme for preserving surface boundaries which does not use connectivity information, and a scheme for constraining the position of the "representative vertex" of a grid cell to an optimal position inside the cell.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Visualization Conference
EditorsT. Ertl, K. Joy, A. Varshney
Pages121-126
Number of pages6
StatePublished - 2001
EventVisualization 2001 - San Diego, CA, United States
Duration: Oct 21 2001Oct 26 2001

Other

OtherVisualization 2001
CountryUnited States
CitySan Diego, CA
Period10/21/0110/26/01

Fingerprint

Data storage equipment
Information use

Keywords

  • External sorting
  • Large data
  • Out-of-core algorithms
  • Polygonal surface simplification
  • Quadric error metrics

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Lindstrom, P., & Silva, C. T. (2001). A memory insensitive technique for large model simplification. In T. Ertl, K. Joy, & A. Varshney (Eds.), Proceedings of the IEEE Visualization Conference (pp. 121-126)

A memory insensitive technique for large model simplification. / Lindstrom, P.; Silva, C. T.

Proceedings of the IEEE Visualization Conference. ed. / T. Ertl; K. Joy; A. Varshney. 2001. p. 121-126.

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

Lindstrom, P & Silva, CT 2001, A memory insensitive technique for large model simplification. in T Ertl, K Joy & A Varshney (eds), Proceedings of the IEEE Visualization Conference. pp. 121-126, Visualization 2001, San Diego, CA, United States, 10/21/01.
Lindstrom P, Silva CT. A memory insensitive technique for large model simplification. In Ertl T, Joy K, Varshney A, editors, Proceedings of the IEEE Visualization Conference. 2001. p. 121-126
Lindstrom, P. ; Silva, C. T. / A memory insensitive technique for large model simplification. Proceedings of the IEEE Visualization Conference. editor / T. Ertl ; K. Joy ; A. Varshney. 2001. pp. 121-126
@inproceedings{c05a37f39e15487880a2cb548b68898a,
title = "A memory insensitive technique for large model simplification",
abstract = "In this paper we propose three simple, but significant improvements to the OoCS (Out-of-Core Simplification) algorithm of Lindstrom which increase the quality of approximations and extend the applicability of the algorithm to an even larger class of compute systems. The original OoCS algorithm has memory complexity that depends on the size of the output mesh, but no dependency on the size of the input mesh. That is, it can be used to simplify meshes of arbitrarily large size, but the complexity of the output mesh is limited by the amount of memory available. Our first contribution is a version of OoCS that removes the dependency of having enough memory to hold (even) the simplified mesh. With our new algorithm, the whole process is made essentially independent of the available memory on the host computer. Our new technique uses disk instead of main memory, but it is carefully designed to avoid costly random accesses. Our two other contributions improve the quality of the approximations generated by OoCS. We propose a scheme for preserving surface boundaries which does not use connectivity information, and a scheme for constraining the position of the {"}representative vertex{"} of a grid cell to an optimal position inside the cell.",
keywords = "External sorting, Large data, Out-of-core algorithms, Polygonal surface simplification, Quadric error metrics",
author = "P. Lindstrom and Silva, {C. T.}",
year = "2001",
language = "English (US)",
pages = "121--126",
editor = "T. Ertl and K. Joy and A. Varshney",
booktitle = "Proceedings of the IEEE Visualization Conference",

}

TY - GEN

T1 - A memory insensitive technique for large model simplification

AU - Lindstrom, P.

AU - Silva, C. T.

PY - 2001

Y1 - 2001

N2 - In this paper we propose three simple, but significant improvements to the OoCS (Out-of-Core Simplification) algorithm of Lindstrom which increase the quality of approximations and extend the applicability of the algorithm to an even larger class of compute systems. The original OoCS algorithm has memory complexity that depends on the size of the output mesh, but no dependency on the size of the input mesh. That is, it can be used to simplify meshes of arbitrarily large size, but the complexity of the output mesh is limited by the amount of memory available. Our first contribution is a version of OoCS that removes the dependency of having enough memory to hold (even) the simplified mesh. With our new algorithm, the whole process is made essentially independent of the available memory on the host computer. Our new technique uses disk instead of main memory, but it is carefully designed to avoid costly random accesses. Our two other contributions improve the quality of the approximations generated by OoCS. We propose a scheme for preserving surface boundaries which does not use connectivity information, and a scheme for constraining the position of the "representative vertex" of a grid cell to an optimal position inside the cell.

AB - In this paper we propose three simple, but significant improvements to the OoCS (Out-of-Core Simplification) algorithm of Lindstrom which increase the quality of approximations and extend the applicability of the algorithm to an even larger class of compute systems. The original OoCS algorithm has memory complexity that depends on the size of the output mesh, but no dependency on the size of the input mesh. That is, it can be used to simplify meshes of arbitrarily large size, but the complexity of the output mesh is limited by the amount of memory available. Our first contribution is a version of OoCS that removes the dependency of having enough memory to hold (even) the simplified mesh. With our new algorithm, the whole process is made essentially independent of the available memory on the host computer. Our new technique uses disk instead of main memory, but it is carefully designed to avoid costly random accesses. Our two other contributions improve the quality of the approximations generated by OoCS. We propose a scheme for preserving surface boundaries which does not use connectivity information, and a scheme for constraining the position of the "representative vertex" of a grid cell to an optimal position inside the cell.

KW - External sorting

KW - Large data

KW - Out-of-core algorithms

KW - Polygonal surface simplification

KW - Quadric error metrics

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

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

M3 - Conference contribution

SP - 121

EP - 126

BT - Proceedings of the IEEE Visualization Conference

A2 - Ertl, T.

A2 - Joy, K.

A2 - Varshney, A.

ER -