Minimal enclosing parallelogram with application

Authors:
Christian Schwarz;Jürgen Teich;Alek Vainshtein;Emo Welzl;Brian L. Evans
Affiliations:
Max-Planck-Institut f. Informatik Im Stadtald, D-66123, Saarbrücken, Germany;Institut TIK, ETH Zürich, Gloriastr. 35, CH-8092 Zürich, Switzerland;School of Math. Sci., Tel Aviv Univ., Tel Aviv, Israel;Freie Univ. Berlin, Inst. f. Informatik, Takustr. 9, D-14195, Berlin, Germany;Dept. of Electrical Eng. and Computer Sci., Univ. of California, Berkeley, CA
Venue:
Proceedings of the eleventh annual symposium on Computational geometry
Year:
1995

The virtual mesh: a geometric abstraction for efficiently computing radiosity

ACM Transactions on Graphics (TOG)
Minimal enclosing parallelepiped in 3D

Computational Geometry: Theory and Applications
Geometric containers for efficient shortest-path computation

Journal of Experimental Algorithmics (JEA)
The sensor selection problem for bounded uncertainty sensing models

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Articulation-invariant representation of non-planar shapes

ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III

Hi-index	0.00