70 search results - page 13 / 14 » Circular Separability of Polygons |
114
click to vote
DSRT
2005
IEEE
14 years 11 months ago
2005
IEEE
Due to the popularity of polygonal models in the Virtual Reality applications, 3D mesh compression and segmentation are two active areas of 3D object modeling. Most existing 3D co...
COMPGEOM
2008
ACM
14 years 11 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
CAD
2008
Springer
14 years 9 months ago
2008
Springer
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
COMPUTING
2007
14 years 9 months ago
2007
We present a multiresolution morphing algorithm using “as-rigid-as-possible” shape interpolation combinedwithanangle-lengthbasedmultiresolutiondecompositionofsimple2Dpiecewise...