Sciweavers

286 search results - page 21 / 58
» Re-tiling polygonal surfaces
Sort
View
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 3 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...
CGF
2010
120views more  CGF 2010»
13 years 8 months ago
Polygonal mesh watermarking using Laplacian coordinates
We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x,y...
Ying Yang, Ioannis P. Ivrissimtzis
IROS
2008
IEEE
243views Robotics» more  IROS 2008»
14 years 3 months ago
Fast plane detection and polygonalization in noisy 3D range images
— A very fast but nevertheless accurate approach for surface extraction from noisy 3D point clouds is presented. It consists of two parts, namely a plane fitting and a polygonal...
Jann Poppinga, Narunas Vaskevicius, Andreas Birk 0...
VISUALIZATION
1997
IEEE
14 years 6 days 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
CAGD
2010
125views more  CAGD 2010»
13 years 6 months ago
Precise Hausdorff distance computation between polygonal meshes
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
Michael Barton, Iddo Hanniel, Gershon Elber, Myung...