Methods for approximating loop subdivision using tessellation enabled GPUs

Ashish Amresh, John Femiani, Christoph Fünfzig

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

2 Citations (Scopus)

Abstract

Subdivision surfaces provide a powerful alternative to polygonal rendering. The availability of tessellation supported hardware presents an opportunity to develop algorithms that can render subdivision surfaces in realtime. We discuss the performance of approximating Loop Subdivision surfaces using tessellation-enabled GPUs in terms of speed and quality of rendering for these methods as well as the implementation strategy. We also propose a novel one pass unified rendering setup for all three methods. Subdivision using the Loop method supports arbitrary triangle meshes and provides for easy transition from polygonal rendering of triangles to the parametric domain. Majority of graphics software applications, especially game engines, render polygons as triangles. The objectives of this paper are to evaluate the performance of smooth rendering algorithms developed to take advantage of tessellator enabled GPUs, provide an easy transition from polygonal to parametric rendering and propose an optimal way to achieve multi-level rendering dependent on performance and visual needs of the application.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages115-125
Number of pages11
Volume7431 LNCS
EditionPART 1
DOIs
StatePublished - 2012
Event8th International Symposium on Visual Computing, ISVC 2012 - Rethymnon, Crete, Greece
Duration: Jul 16 2012Jul 18 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume7431 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Symposium on Visual Computing, ISVC 2012
CountryGreece
CityRethymnon, Crete
Period7/16/127/18/12

Fingerprint

Tessellation
Subdivision
Rendering
Subdivision Surfaces
Application programs
Triangle
Availability
Engines
Hardware
Triangle Mesh
Graphics processing unit
Polygon
Engine
Game
Real-time
Software
Dependent
Evaluate
Alternatives
Arbitrary

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Amresh, A., Femiani, J., & Fünfzig, C. (2012). Methods for approximating loop subdivision using tessellation enabled GPUs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 1 ed., Vol. 7431 LNCS, pp. 115-125). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7431 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-33179-4_12

Methods for approximating loop subdivision using tessellation enabled GPUs. / Amresh, Ashish; Femiani, John; Fünfzig, Christoph.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7431 LNCS PART 1. ed. 2012. p. 115-125 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7431 LNCS, No. PART 1).

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

Amresh, A, Femiani, J & Fünfzig, C 2012, Methods for approximating loop subdivision using tessellation enabled GPUs. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 edn, vol. 7431 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 7431 LNCS, pp. 115-125, 8th International Symposium on Visual Computing, ISVC 2012, Rethymnon, Crete, Greece, 7/16/12. https://doi.org/10.1007/978-3-642-33179-4_12
Amresh A, Femiani J, Fünfzig C. Methods for approximating loop subdivision using tessellation enabled GPUs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 ed. Vol. 7431 LNCS. 2012. p. 115-125. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). https://doi.org/10.1007/978-3-642-33179-4_12
Amresh, Ashish ; Femiani, John ; Fünfzig, Christoph. / Methods for approximating loop subdivision using tessellation enabled GPUs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7431 LNCS PART 1. ed. 2012. pp. 115-125 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
@inproceedings{442c5255bec342d4ac26f057a442047d,
title = "Methods for approximating loop subdivision using tessellation enabled GPUs",
abstract = "Subdivision surfaces provide a powerful alternative to polygonal rendering. The availability of tessellation supported hardware presents an opportunity to develop algorithms that can render subdivision surfaces in realtime. We discuss the performance of approximating Loop Subdivision surfaces using tessellation-enabled GPUs in terms of speed and quality of rendering for these methods as well as the implementation strategy. We also propose a novel one pass unified rendering setup for all three methods. Subdivision using the Loop method supports arbitrary triangle meshes and provides for easy transition from polygonal rendering of triangles to the parametric domain. Majority of graphics software applications, especially game engines, render polygons as triangles. The objectives of this paper are to evaluate the performance of smooth rendering algorithms developed to take advantage of tessellator enabled GPUs, provide an easy transition from polygonal to parametric rendering and propose an optimal way to achieve multi-level rendering dependent on performance and visual needs of the application.",
author = "Ashish Amresh and John Femiani and Christoph F{\"u}nfzig",
year = "2012",
doi = "10.1007/978-3-642-33179-4_12",
language = "English (US)",
isbn = "9783642331787",
volume = "7431 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "115--125",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 1",

}

TY - GEN

T1 - Methods for approximating loop subdivision using tessellation enabled GPUs

AU - Amresh, Ashish

AU - Femiani, John

AU - Fünfzig, Christoph

PY - 2012

Y1 - 2012

N2 - Subdivision surfaces provide a powerful alternative to polygonal rendering. The availability of tessellation supported hardware presents an opportunity to develop algorithms that can render subdivision surfaces in realtime. We discuss the performance of approximating Loop Subdivision surfaces using tessellation-enabled GPUs in terms of speed and quality of rendering for these methods as well as the implementation strategy. We also propose a novel one pass unified rendering setup for all three methods. Subdivision using the Loop method supports arbitrary triangle meshes and provides for easy transition from polygonal rendering of triangles to the parametric domain. Majority of graphics software applications, especially game engines, render polygons as triangles. The objectives of this paper are to evaluate the performance of smooth rendering algorithms developed to take advantage of tessellator enabled GPUs, provide an easy transition from polygonal to parametric rendering and propose an optimal way to achieve multi-level rendering dependent on performance and visual needs of the application.

AB - Subdivision surfaces provide a powerful alternative to polygonal rendering. The availability of tessellation supported hardware presents an opportunity to develop algorithms that can render subdivision surfaces in realtime. We discuss the performance of approximating Loop Subdivision surfaces using tessellation-enabled GPUs in terms of speed and quality of rendering for these methods as well as the implementation strategy. We also propose a novel one pass unified rendering setup for all three methods. Subdivision using the Loop method supports arbitrary triangle meshes and provides for easy transition from polygonal rendering of triangles to the parametric domain. Majority of graphics software applications, especially game engines, render polygons as triangles. The objectives of this paper are to evaluate the performance of smooth rendering algorithms developed to take advantage of tessellator enabled GPUs, provide an easy transition from polygonal to parametric rendering and propose an optimal way to achieve multi-level rendering dependent on performance and visual needs of the application.

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

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

U2 - 10.1007/978-3-642-33179-4_12

DO - 10.1007/978-3-642-33179-4_12

M3 - Conference contribution

AN - SCOPUS:84866664342

SN - 9783642331787

VL - 7431 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 115

EP - 125

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -