Sciweavers

498 search results - page 3 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
CGA
2008
13 years 7 months ago
Viewpoint-Based Ambient Occlusion
Ambient occlusion is a powerful technique that mimics indirect global illumination at a fraction of the cost. In this paper, we introduce a new ambient occlusion technique based o...
Francisco González, Mateu Sbert, Miquel Fei...
TOG
2008
136views more  TOG 2008»
13 years 7 months ago
Adaptive cutaways for comprehensible rendering of polygonal scenes
In 3D renderings of complex scenes, objects of interest may be occluded by those of secondary importance. Cutaway renderings address this problem by omitting portions of secondary...
Michael Burns, Adam Finkelstein
SIGGRAPH
2010
ACM
13 years 12 months ago
Triangle surfaces with discrete equivalence classes
We propose a technique that takes a triangulated surface as input and outputs a surface with the same topology but altered geometry such that each polygon falls into a set of disc...
Mayank Singh, Scott Schaefer
DGCI
2006
Springer
13 years 11 months ago
Topological and Geometrical Reconstruction of Complex Objects on Irregular Isothetic Grids
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
Antoine Vacavant, David Coeurjolly, Laure Tougne
WSCG
2004
156views more  WSCG 2004»
13 years 8 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...