DMCA
Arrangements and Their Applications (1998)
| Venue: | Handbook of Computational Geometry |
| Citations: | 81 - 17 self |
BibTeX
@INPROCEEDINGS{Agarwal98arrangementsand,
author = {Pankaj K. Agarwal and Micha Sharir},
title = {Arrangements and Their Applications},
booktitle = {Handbook of Computational Geometry},
year = {1998},
pages = {49--119},
publisher = {Elsevier Science Publishers B.V. North-Holland}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The arrangement of a finite collection of geometric objects is the decomposition of the space into connected cells induced by them. We survey combinatorial and algorithmic properties of arrangements of arcs in the plane and of surface patches in higher dimensions. We present many applications of arrangements to problems in motion planning, visualization, range searching, molecular modeling, and geometric optimization. Some results involving planar arrangements of arcs have been presented in a companion chapter in this book, and are extended in this chapter to higher dimensions. Work by P.A. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.-Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by a Max-Planck Research Award, and by grants from the U.S.-Israeli Binational Science Foundation, the Israel Science Fund administered by the Israeli Ac...
Keyphrases
u.s. israeli binational science foundation sloan fellowship molecular modeling motion planning geometric object many application israel science fund companion chapter israeli ac nsf grant ccr-91-22103 nyi award algorithmic property connected cell geometric optimization max-planck research award surface patch planar arrangement range searching finite collection
