Sciweavers

83 search results - page 11 / 17
» Acute Triangulations of Polygons
Sort
View
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 2 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
VISUALIZATION
1997
IEEE
13 years 11 months ago
Controlled simplification of genus for polygonal models
Genus-reducing simplifications are important in constructing multiresolution hierarchies for level-of-detail-based rendering, especially for datasets that have several relatively ...
Jihad El-Sana, Amitabh Varshney
CGVR
2006
13 years 9 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Michael Boehl, Wolfgang Stürzlinger
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 8 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
TPCG
2003
IEEE
14 years 29 days ago
Planar Bones for MPEG-4 Facial Animation
This paper proposes a deformation technique called Planar Bones, derived from Surface-oriented Free Form Deformations, and explores its application to the context of Facial Animat...
Manuel A. Sánchez Lorenzo, Steve C. Maddock