Abstract
The computational and combinatorial aspects certain problems in computational geometry are investigated. The work sheds light on the general study of external properties of planar subdivisions and convex polytopes. This involves a comprehensive investigation of several classes of problems and their natural variants. The proof techniques introduced enable optimal bounds to be derived for most of the problems considered. From a computational standpoint this paper introduces a unifying framework for solving various optimization problems efficiently.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 66-76 |
| Number of pages | 11 |
| Journal | Conference Proceedings of the Annual ACM Symposium on Theory of Computing |
| State | Published - 1987 |
All Science Journal Classification (ASJC) codes
- Software