Back to Results
First PageMeta Content
Euclidean plane geometry / Convex geometry / Triangulation / Computational geometry / Convex hull / Polygon / Convex set / Pitteway triangulation / Monotone polygon / Geometry / Mathematics / Convex analysis


CCCG 2006, Kingston, Ontario, August 14–16, 2006 Tight Bounds for Point Recolouring Yurai N´ un ˜ez and David Rappaport
Add to Reading List

Document Date: 2008-10-27 22:57:44

Open Document

File Size: 285,93 KB

Share Result on Facebook

City

Kingston / Kaneko / Tampico / Kano / /

Company

Ppq / S. / C. Cambridge University Press / /

Country

Mexico / /

/

Facility

Weizmann Institute Of Science / David Rappaport Queen’s University / /

IndustryTerm

heuristic algorithm / monotone chain / /

Organization

Cambridge University / International Congress / David Rappaport Queen’s University Kingston / Department of Mathematics & Computer Science / Universitat Polit`ecnica De Catalunya / Weizmann Institute of Science / /

Person

Marc Benkert / Marc van Kreveld / Jack Snoeyink / Joseph S.B. Mitchell / Iris Reinbacher / Alexander Wolff / Carlos Seara / /

Position

Prime Minister / scheduler / /

ProvinceOrState

Ontario / /

Technology

heuristic algorithm / /

URL

http /

SocialTag