Back to Results
First PageMeta Content
Polygons / Euclidean plane geometry / 3D computer graphics / Triangulation / Computational geometry / Vertex / Pseudotriangle / Simple polygon / Polyhedron / Geometry / Graph theory / Mathematics


CCCG 2011, Toronto ON, August 10–12, 2011 Convexifying Polygons Without Losing Visibilities Oswin Aichholzer∗ Ferran Hurtado¶
Add to Reading List

Document Date: 2011-08-06 04:11:15

Open Document

File Size: 2,42 MB

Share Result on Facebook

City

Henares / Bruxelles / New York / /

Company

Cambridge University Press / A. K. Peters Ltd. / Vertex / Oxford University Press Inc. / Artificial Intelligence Laboratory / /

Country

Austria / United States / Spain / /

/

Facility

University of Waterloo / Carleton University / University of Technology Graz / Tufts University / reconfig∗ Institute / /

Organization

University of Technology Graz / School of Computer Science / Cambridge University / National Science Foundation / Department of Computer Science / MIT / reconfig∗ Institute for Software Technology / V (v) / University of Waterloo / Tufts University / Oxford University / Universitat Polit` / Carleton University / Institut f¨ / /

Person

G. Salazar / J. Leanos / R. Fabila-Monroy / Vida Dujmovi / M. Cetina / E. D. Demaine / V / O. Aichholzer / Andrew Winslow / Diane L. Souvaine‡‡ Andrew / Anna Lubiwk Erik / Godfried Toussaint / Ferran Hurtado¶ Greg Aloupis / Brien Demaine / J. Urrutia / Greg Aloupis† Anna Lubiwk / Martin L. Demaine‡ Andr / Cat / E. D. Demaine / Erik D. Demaine / /

Position

representative / General / Carpenter / /

ProgrammingLanguage

D / /

ProvinceOrState

New York / /

PublishedMedium

Theoretical Computer Science / /

TVStation

CBET / /

Technology

http / Visibility Algorithms / Geometric Folding Algorithms / /

URL

http /

SocialTag