Sciweavers

53 search results - page 2 / 11
» Efficient Algorithms for Approximating Polygonal Chains
Sort
View
JCB
2007
168views more  JCB 2007»
13 years 7 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
CGF
2004
127views more  CGF 2004»
13 years 7 months ago
Approximated Centroidal Voronoi Diagrams for Uniform Polygonal Mesh Coarsening
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...
Sébastien Valette, Jean-Marc Chassery
IPL
2006
116views more  IPL 2006»
13 years 7 months ago
Guarding galleries and terrains
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
Alon Efrat, Sariel Har-Peled
AGIS
2008
319views more  AGIS 2008»
13 years 7 months ago
An Efficient Algorithm for Raster-to-Vector Data Conversion
Data conversion from raster to vector (R2V) is a key function in Geographic Information Systems (GIS) and remote sensing (RS) image processing for integrating GIS and RS data. The...
Junhua Teng, Fahui Wang, Yu Liu
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
14 years 1 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...