SIGN IN
SIGN UP
Maximizing the overlap of two planar convex sets under rigid motions
Full Text:
PDF
Buy this Article
Authors:
Hee-Kap Ahn
Korea Advanced Institute of Science and Technology, Daejeon, Korea
Otfried Cheong
Korea Advanced Institute of Science and Technology, Daejeon, Korea
Chong-Dae Park
Korea Advanced Institute of Science and Technology, Daejeon, Korea
Chan-Su Shin
Hankuk University of Foreign Studies, Yongin, Korea
Antoine Vigneron
National University of Singapore, Singapore
2005 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 22
· Downloads (cumulative): 351
· Citation Count: 2
Published in:
· Proceeding
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Pages 356-363
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-58113-991-8
doi>
10.1145/1064092.1064146
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
approximation algorithm
convex shape
geometrical problems and computations
pattern matching
sublinear algorithm
theory
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