English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. Search Results / 
  2. View item

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
 PreviousNext  
  Towards Hardware Implementation of Loop Subdivision

Bischoff, S., Kobbelt, L. P., & Seidel, H.-P. (2000). Towards Hardware Implementation of Loop Subdivision. In S. N. Spencer (Ed.), Proceedings of 2000 ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware (pp. 41-50). New York, NY: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3500-C Version Permalink: https://hdl.handle.net/21.11116/0000-000E-6BD7-8
Genre: Conference Paper

Files

show Files
hide Files
:
loop_render1.pdf (Preprint), 852KB
View   Save
File Permalink:
https://hdl.handle.net/21.11116/0000-000E-6BD8-7
Name:
loop_render1.pdf
Description:
-
OA-Status:
Not specified
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
© ACM, 2000. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in 10.1145/346876.346886.
License:
-

Locators

show

Creators

show
hide
 Creators:
Bischoff, Stephan1, Author           
Kobbelt, Leif P.1, Author           
Seidel, Hans-Peter1, Author                 
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              

Content

show
hide
Free keywords: -
 Abstract: We present a novel algorithm to evaluate and render Loop subdivision
surfaces. The algorithm exploits the fact that Loop subdivision
surfaces are piecewise polynomial and uses the forward difference
technique for efficiently computing uniform samples on the limit
surface. The main advantage of our algorithm is that it only
requires a small and constant amount of memory that does not depend
on the subdivision depth. The simple structure of the algorithm
enables a scalable degree of hardware implementation. By low-level
parallelization of the computations, we can reduce the critical
computation costs to a theoretical minimum of about one {\tt
float[3]}-operation per triangle.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-122000
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 520155
Other: Local-ID: C125675300671F7B-9E86BC79F1CAABB5C12569BC00497067-Bischoff2000
DOI: 10.1145/346876.346886
BibTex Citekey: Bischoff-et-al_SIGGRAPH/Eurographics2000
 Degree: -

Event

show
hide
Title: 2000 ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware
Place of Event: Interlaken, Switzerland
Start-/End Date: 2000-08-21 - 2000-08-22

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of 2000 ACM SIGGRAPH/Eurographics Workshop on Graphics Hardware
Source Genre: Proceedings
 Creator(s):
Spencer, Stephen N.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 41 - 50 Identifier: ISBN: 978-1-58113-257-1