Back to Results
First PageMeta Content
Convex geometry / Polygons / Analytic geometry / Circle / Chord / Geodesic convexity / Geodesic / Convex set / Simple polygon / Geometry / Curves / Elementary geometry


March 25, 2005 8:15 WSPC/Guidelines chordsep SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
Add to Reading List

Document Date: 2007-12-27 15:24:30

Open Document

File Size: 234,80 KB

Share Result on Facebook

City

Barcelona / Cambridge / /

Company

Artificial Intelligence Laboratory / /

Country

Jordan / Spain / United States / /

/

Facility

Queen’s University / Utrecht University / University of Illinois / MARK OVERMARS Institute / MetroTech Center / McGill University / Polytechnic University / /

IndustryTerm

line sweep algorithm / straightforward dynamic programming algorithm / strip algorithm / polynomialtime algorithms / similar algorithm / /

Organization

MetroTech Center / University of Illinois / Polytechnic University / HENK MEIJER School of Computing / SUE WHITESIDES‡ School of Computer Science / MIT / Queen’s University / Kingston / McGill University / JOHN IACONO Department of Computer and Information Science / JEFF ERICKSON Department of Computer Science / Utrecht University / Universitat Polit` / MARK OVERMARS Institute / /

Person

FERRAN HURTADO / SUE WHITESIDES / JOHN IACONO / STEFAN LANGERMAN / /

Position

segment mp / /

ProgrammingLanguage

D / R / /

ProvinceOrState

Massachusetts / /

Technology

straightforward dynamic programming algorithm / similar algorithm / strip algorithm / line sweep algorithm / polynomialtime algorithms / /

SocialTag