Back to Results
First PageMeta Content
Art gallery problem / Polygon triangulation / Monotone polygon / Star-shaped polygon / Polygon / Visibility polygon / Binary space partitioning / Vertex / Computational geometry / Geometry / Polygons / Simple polygon


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Triangulating and Guarding Realistic Polygons G. Aloupis ∗
Add to Reading List

Document Date: 2008-10-29 00:01:26


Open Document

File Size: 121,94 KB

Share Result on Facebook

City

Bruxelles / New York / /

Company

Oxford University Press / /

Country

Netherlands / Belgique / /

/

Facility

Carleton University / Utrecht University / Institute of Information / McGill University / /

IndustryTerm

incremental randomized algorithm / implementable linear-time algorithm / polygonal chain / implementable algorithms / geometric algorithms / linear time algorithm / On-line construction / linear algorithm / computing / convex hull algorithm / triangulation algorithm / /

Organization

Organisation for Scientific Research / McGill University / Oxford University / Utrecht University / Institute of Information and Computing Sciences / Carleton University / /

Person

C. Gray / Mark de Berg / Maria M. Klawe / Boris Aronov / David G. Kirkpatrick / Prosenjit Bose / Robert Endre Tarjan / /

Position

VP / guard / visibility polygon VP / EVP / /

ProvinceOrState

New York / /

PublishedMedium

ACM Transactions on Graphics / /

Technology

linear algorithm / randomized algorithm / 3-d / 1 Introduction Algorithms / 4 The algorithm / linear time algorithm / second algorithm / Seidel algorithm / 5 The algorithm / convex hull algorithm / implementable linear-time algorithm / triangulation algorithm / incremental randomized algorithm / /

SocialTag