Back to Results
First PageMeta Content
Rotating calipers / Polygon / Circumscribed circle / Triangle / Priority queue / Polygon triangulation / Pitteway triangulation / Geometry / Triangulation / Delaunay triangulation


CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 An Algorithm for the MaxMin Area Triangulation of a Convex Polygon J. Mark Keil, Tzvetalin S. Vassilev Department of Computer Science University of Saskatchewan, 57
Add to Reading List

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

Open Document

File Size: 122,31 KB

Share Result on Facebook

City

Athens / Bern / Halifax / Groningen / /

Company

Sandia National Laboratories / /

Country

Greece / Netherlands / /

/

Facility

Computer Science University of Saskatchewan / Campus Drive / McGill University / /

IndustryTerm

subcubic time algorithm / problem-specific algorithms / dynamic programming algorithm / binary search / polynomial time algorithm / /

Organization

Tzvetalin S. Vassilev Department / McGill University / Montreal / University of Saskatchewan / /

Person

Van Emde-Boas / J. Mark Keil / /

Position

Prime Minister / /

ProvinceOrState

Nova Scotia / /

Technology

4 The algorithm Algorithm / 2003 An Algorithm / dynamic programming algorithm / polynomial time algorithm / subcubic time algorithm / problem-specific algorithms / 4 The algorithm / PKI / /

SocialTag