Back to Results
First PageMeta Content
Curves / Complex analysis / Pi / Circle / Angle / Logarithm / Geometry / Mathematical analysis / Mathematics


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Polygonal Chain Simplification with Small Angle Constraints Ovidiu Daescu∗ Anastasia Kurdia†
Add to Reading List

Document Date: 2008-10-29 00:00:03

Open Document

File Size: 131,06 KB

Share Result on Facebook

City

Philadelphia / London / New York / /

Company

Springer-Verlag New York Inc. / /

Country

United States / United Kingdom / /

/

Facility

store I / University of Texas / /

IndustryTerm

off-line ball exclusion search problem / Space-efficient algorithms / off-line ball inclusion search problem / query processing / divide-and-conquer algorithm / greedy algorithm / linear-time algorithm / dynamic programming algorithm / /

Organization

National Science Foundation / Department of Computer Science / Society for Industrial and Applied Mathematics / University of Texas at Dallas / /

Person

Marc van Kreveld / Mark de Berg / David P. Dobkin / Ovidiu Daescu / Pankaj K. Agarwal / Lars Arge / Peter M. Kogge / Otfried Schwarzkopf / Jack Snoeyink / Ningfang Mi / Mark Overmars / Ke Yi / Danny Z. Chen / David G. Kirkpatrick / John Hershberger / Bernard Chazelle / /

ProvinceOrState

Texas / New York / /

Technology

dynamic programming algorithm / linear-time algorithm / divide-and-conquer algorithm / /

SocialTag