SIGN IN
SIGN UP
Minimal enclosing parallelogram with application
Full Text:
Pdf
Buy this Article
Authors:
Christian Schwarz
Max-Planck-Institut f. Informatik Im Stadtald, D-66123, Saarbrücken, Germany
Jürgen Teich
Institut TIK, ETH Zürich, Gloriastr. 35, CH-8092 Zürich, Switzerland
Alek Vainshtein
School of Math. Sci., Tel Aviv Univ., Tel Aviv, Israel
Emo Welzl
Freie Univ. Berlin, Inst. f. Informatik, Takustr. 9, D-14195, Berlin, Germany
Brian L. Evans
Dept. of Electrical Eng. and Computer Sci., Univ. of California, Berkeley, CA
1995 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 14
· Downloads (cumulative): 236
· Citation Count: 5
Published in:
· Proceeding
SCG '95
Proceedings of the eleventh annual symposium on Computational geometry
Pages 434 - 435
ACM
New York, NY
, USA
©1995
table of contents
ISBN:0-89791-724-3
doi>
10.1145/220279.220338
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
design
geometrical problems and computations
mathematica
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder