Comparison of Accelerating Techniques for Discontinuity Meshing

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F03%3A00008022" target="_blank" >RIV/00216224:14330/03:00008022 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Comparison of Accelerating Techniques for Discontinuity Meshing

Original language description

Creating an appropriate mesh is one of demanding tasks of many global illumination algorithms. Discontinuity meshing proved to diminish artifacts caused by other meshing strategies. Since naive discontinuity meshing would produce a great amount of geometric computations, accelerating techniques are usually involved. In this paper, we present results obtained with help of k-discrete orientation polytopes (k-DOPs) and oriented bounding boxes (OBBs) and compare them to previously used accelerating schemeslike voxels, BSP-trees and octrees.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/GV201%2F98%2FK041" target="_blank" >GV201/98/K041: HCILAB - human - computer interactions laboratory</a><br>

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2003

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

WSCG'2003 Short papers

ISBN

80-903100-1-X

ISSN

—

e-ISSN

—

Number of pages

9

Pages from-to

95-103

Publisher name

University of West Boehemia

Place of publication

Plzen

Event location

Plzeň

Event date

Jan 1, 2003

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—