Sciweavers

1641 search results - page 140 / 329
» The 3D visibility complex
Sort
View
AFRIGRAPH
2003
ACM
15 years 1 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
SMA
2009
ACM
157views Solid Modeling» more  SMA 2009»
15 years 4 months ago
Constraint-based model synthesis
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...
Paul Merrell, Dinesh Manocha
TOG
2008
79views more  TOG 2008»
14 years 10 months ago
Continuous model synthesis
We present a novel method for procedurally modeling large complex shapes. Our approach is general-purpose and takes as input any 3D polyhedral model provided by a user. The algori...
Paul Merrell, Dinesh Manocha
ICMCS
2007
IEEE
101views Multimedia» more  ICMCS 2007»
15 years 4 months ago
View-Dependent Visibility Estimation for Tree Models
— A view-dependent visibility estimation technique for tree models is proposed in this work. While most previous work focused on visibility estimation of large objects in archite...
Jessy Lee, Jingliang Peng, C. C. Jay Kuo
COMPGEOM
2004
ACM
15 years 3 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...