Back to Results
First PageMeta Content
Euclidean plane geometry / Quadrilaterals / Rectangle / Angle / Wedge / Simple polygon / Internal and external angle / Convex and concave polygons / Geometry / Euclidean geometry / Polygons


CCCG 2006, Kingston, Ontario, August 14–16, 2006 On computing shortest external watchman routes for convex polygons Rafa Absar∗ and Sue Whitesides† Abstract
Add to Reading List

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

Open Document

File Size: 222,87 KB

Share Result on Facebook

City

Kingston / /

Company

Oxford University Press / /

Country

Canada / /

/

Facility

McGill University / /

IndustryTerm

linear-time algorithm / parallel algorithms / computing / linear-time algorithms / /

Organization

School of Computer Science / McGill University / Oxford University / McGill University / Montreal / /

Person

Sue Whitesides† Abstract Wm / Wc / Rafa Absar / /

Position

Wb / /

ProvinceOrState

Ontario / /

PublishedMedium

Theory of Computing / /

Technology

linear-time algorithm / linear-time algorithms / Parallel Processing / /

SocialTag