Geometric Data Structures for Computer Graphics
In proceedings of Proceedings of ACM SIGGRAPH 2003, ACM SIGGRAPH 2003, July 2003
Presented at SIGGRAPH 2003
Abstract
In recent years, methods from computational geometry have been widely adopted by the computer graphics community yielding elegant and efficient algorithms. This course aims at familiarizing practitioners in the computer graphics field with a wide range of data structures from computational geometry. It will enable attendees to recognize geometrical problems and select the most suitable data structure when developing computer graphics algorithms.
The course will focus on algorithms and data structures that have proven to be versatile, efficient, fundamental and easy to implement. Thus practitioners and researchers will benefit immediately from this course for their everyday work.
Download Paper
Bibtex
@INPROCEEDINGS{zachmann-2003-geometric,
author = {Zachmann, Gabriel and Langetepe, E.},
title = {Geometric Data Structures for Computer Graphics},
booktitle = {Proceedings of ACM SIGGRAPH 2003},
year = {2003},
month = jul,
publisher = {ACM SIGGRAPH 2003},
abstract = {In recent years, methods from computational geometry have been widely adopted by the computer
graphics community yielding elegant and efficient algorithms. This course aims at familiarizing
practitioners in the computer graphics field with a wide range of data structures from computational
geometry. It will enable attendees to recognize geometrical problems and select the most suitable
data structure when developing computer graphics algorithms.
The course will focus on algorithms and data structures that have proven to be versatile, efficient,
fundamental and easy to implement. Thus practitioners and researchers will benefit immediately from
this course for their everyday work.},
conference = {SIGGRAPH 2003}
}