65 search results - page 2 / 13 » Efficiently Generating Structurally Complex Inputs with Thou... |
WSCG
2001
13 years 6 months ago
2001
Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these oc...
INLG
2010
Springer
13 years 3 months ago
2010
Springer
This paper discusses the basic structures necessary for the generation of reference to objects in a visual scene. We construct a study designed to elicit naturalistic referring ex...
SMA
2009
ACM
13 years 11 months ago
2009
ACM
We present a method for procedurally modeling general complex 3D shapes. Our approach is targeted towards applications in digital entertainment and gaming and can automatically ge...
EUROCAST
2007
Springer
13 years 9 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
VMV
2004
13 years 6 months ago
2004
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...