Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
PG '98 Proceedings of the 6th Pacific Conference on Computer Graphics and Applications
Approximating polyhedral objects with deformable smooth surfaces
Computational Geometry: Theory and Applications
Zero-knowledge proof of generalized compact knapsacks (or a novel identification/signature scheme)
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
| Hi-index | 0.00 |
Edelsbrunner et al defined a framework of shape deformations with shapes bounded by skin manifold We prove that the infinitely many synthesized shapes in the deformation sequence share finitely many common Voronoi complexes Therefore, we propose a new algorithm to compute the common Voronoi complexes efficiently for the deformations, and use these common complexes to compute the synthesized shapes in real time This makes generating, visualizing, and customizing shape deformations feasible.