Back to Results
First PageMeta Content
Heuristics / Discrete geometry / Mathematical optimization / Operations research / Minkowski addition / Polygon / Packing problem / Triangle / Geometry / Mathematics / Euclidean plane geometry


CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering K. Daniels
Add to Reading List

Document Date: 2004-01-08 18:44:30

Open Document

File Size: 103,48 KB

Share Result on Facebook

City

Halifax / New York / Lowell / /

Company

Sun Microsystems Corporation / SO(n R) Rn / CRC Press / /

Currency

pence / /

Facility

Institute of Industrial Engineers / The University of New Hampshire / University of Massachusetts Lowell / /

IndustryTerm

apparel manufacturing / polygonal covering algorithm / manufacturing / incremental algorithm / possible solutions / given / 2D covering applications / telecommunications / /

Organization

Decision Sciences Department / University of New Hampshire / Durham / Institute of Industrial Engineers / Whittemore School of Business and Economics / University of Massachusetts Lowell / Computer Science Department / /

Product

Ultra / /

ProgrammingLanguage

C++ / /

ProvinceOrState

Nova Scotia / New York / Massachusetts / New Hampshire / /

Technology

previous algorithm / molecular modeling / polygonal covering algorithm / incremental algorithm / /

SocialTag