Modified mesh-connected computers for image processing applications
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Understanding and automating algorithm design
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Collision avoidance and low-observable navigation in a dynamic environment
Mathematical and Computer Modelling: An International Journal
| Hi-index | 14.98 |
We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms. This newly emerged area of activities has found numerous applications in various other disciplines, such as computer-aided design, computer graphics, operations research, pattern recognition, robotics, and statistics. Five major problem areas convex hulls, intersections, searching, proximity, and combinatorial optimizations are discussed. Seven algorithmic techniques incremental construction, plane-sweep, locus, divide-and-conquer, geometric transformation, prune-and-search, and dynamization are each illustrated with an example. A collection of problem transformations to establish lower bounds for geo-metric problems in the algebraic computation/decision model is also included.