Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

74

Voted

IJCGA
2006

favoriteEmaildiscussreport

40views more IJCGA 2006»

Minimum Area Convex Packing of Two Convex Polygons

15 years 1 months ago

Minimum Area Convex Packing of Two Convex Polygons

Download ihome.ust.hk

Kai Tang, Charlie C. L. Wang, Danny Z. Chen

Real-time Traffic

IJCGA 2006 |

claim paper

Related Content

» On MinimumArea Hulls

» A PTAS for Cutting Out Polygons with Lines

» Two LinearTime Algorithms for Computing the Minimum Length Polygon of a Digital Contour

» Decomposing a simple polygon into pseudotriangles and convex polygons

» New Algorithms for Minimum Area kgons

» On the Camera Placement Problem

» MinimumLength Polygons in Approximation Sausages

» Heuristics for estimating contact area of supports in layered manufacturing

» Extremal problems on triangle areas in two and three dimensions

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	IJCGA
Authors	Kai Tang, Charlie C. L. Wang, Danny Z. Chen

Comments (0)