Maximizing the overlap of two planar convex sets under rigid motions
10.1145/1064092.1064146
Saved in:
Main Authors: | Ahn, H.-K., Cheong, O., Park, C.-D., Shin, C.-S., Vigneron, A. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/40716 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
by: Ahn, H.-K., et al.
Published: (2013) -
Sublinear Algorithms in T-interval Dynamic Networks
by: I. Jahja, et al.
Published: (2021) -
A fast algorithm for convex hull extraction in 2D images
by: Ye, Q.-Z.
Published: (2014) -
Profit Maximization for Viral Marketing in Online Social Networks
by: Tang, Jing, et al.
Published: (2016) -
Approximate matching of complex structures
by: RAJIV PANICKER
Published: (2010)