935 search results - page 83 / 187 » A computationally efficient 3D shape rejection algorithm |
SMA
2010
ACM
14 years 11 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
104
click to vote
IMR
1998
Springer
15 years 3 months ago
1998
Springer
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
CGI
2004
IEEE
15 years 2 months ago
2004
IEEE
We give an efficient, scalable, and simple algorithm for computation of a central path for navigation in closed virtual environments. The algorithm requires less preprocessing and...
83
Voted
IMR
2004
Springer
15 years 4 months ago
2004
Springer
We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured ...
110
click to vote
ADT
2005
14 years 11 months ago
2005
In this paper we present a new framework, based on subdivision surface approximation, for efficient compression and coding of 3D models represented by polygonal meshes. Our algorit...