Skip to main navigation Skip to search Skip to main content

Hamiltonian triangulations for fast rendering

  • Stony Brook University
  • University of Salzburg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

23 Scopus citations

Abstract

High-performance rendering engines in computer graphics are often pipelined, and their speed is bounded by the rate at which triangulation data can be sent into the machine. To reduce the data rate, it is desirable to order the triangles so that consecutive triangles share a face, meaning that only one additional vertex need be transmitted to describe each triangle. Such an ordering exists if and only if the dual graph of the triangulation contains a Hamiltonian path. In this paper, we consider several problems concerning triangulations with Hamiltonian duals and a related class of “sequential triangulations”.

Original languageEnglish
Title of host publicationAlgorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
EditorsJan van Leeuwen
PublisherSpringer Verlag
Pages36-47
Number of pages12
ISBN (Print)9783540584346
DOIs
StatePublished - 1994
Event2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands
Duration: Sep 26 1994Sep 28 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume855 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd Annual European Symposium on Algorithms, ESA 1994
Country/TerritoryNetherlands
CityUtrecht
Period09/26/9409/28/94

Fingerprint

Dive into the research topics of 'Hamiltonian triangulations for fast rendering'. Together they form a unique fingerprint.

Cite this