
...is offered. some methods from computational geometry are exploited to store the picture in a computer such that (1) those line...the window is moved parallel to a coordinate axis and/or it is enlarged or...

...rays using raytracing techniques. due to many advances in computer science, and especially computer graphics over the last decade, interactive 3d sound simulations for complex and dynamic environments are within reach. inthispaperweanalyzesoundpropagationintermsofacoustic energy and explore the possibilities to map these concepts to ra diometry and graphics rendering equations. although we concen...
Published in 2007.

...developed using these high performance computing systems, but also of ways to improve the performances over the classical case. exploiting this parallelism recently led to the emergence of innovative ideas in the field of computer graphics, sketching the development of quantum rendering and quantum computational geometry. following these tracks, we...

...networks (bns) can be used to model common temporal knowledge. two approaches to their structuring are proposed. the first leads to bns with nodes representing states of a process and times spent in such states, and with a graphical structure reflecting the conditional independence assumptions of a markovian process...

...as volume data for analysis and verification. recently ,m an yt raditional geometric computer graphics applications, such as cad and simulation, ha ve exploited the advantages of volume techniques called volume graphics for modeling, manipulation, and visualization. vo lume graphics (38), which is an emerging subfield of computer graphics, is concerned with the synthesis...

...developed algorithms that use caching and lazy creation of texture and geometry to manage scene complexity. to improve cache performance, we increase...cr categories: i.3.3 (computer graphics): picture/image gen eration; i.3.7 (computer graphics): threedimensional graphics and realism—raytracing...

...decision diagrams are graphical structures based on shannon's decomposition. they have been extensively used for representing and manipulating logic functions in areas...logarithmically encoded binary decision diagrams, and multivalued decision diagrams. we present both separated, and shared methods based on these decision diagrams. comprehensive complexity analysis, and performance comparisons among these methods...

...conditioning graph (cg) is a graphical structure that at tempt to minimize the implementation overhead of computing probabil ities in belief networks...network, but restricting each decomposition to a single node allows us to store the structure with minimal overhead, and compute with a simple algorithm. this...

...this paper presents a technique to improves the performance of algorithms that exploits visibility based analysis in computer graphics, such as ray tracing. the...analysis stage that is viewindependent is computed once per scene, creating a visibility data structure (vds) that becomes part of...

...models, linear statespace models, and other models of interestfor which this bound on the marginal likelihood can be computed very simply through a modication...focus on applying these bounds to the problem of scoring discrete directed graphical model structures (bayesian networks). extensive simulations comparing the variational bounds to the usual approach based on...
Published in 2003.