Work

Efficient algorithms for geometric optimization

Year: 1998

Type: article

Abstract: We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, prune-and-search techniques for linear programming and related problems, and LP-type problems and their efficient solution. We then describe a wide range of applications of these and other techniques to numerous problems in geometric optimization, including facility location, proximity problems, statistical estimators and metrology, placement and intersection of polygons and polyhedra, and ray shooting and other query-type problems.

Source: ACM Computing Surveys

DOI: 10.1145/299917.299918

Authors: Pankaj K. Agarwal, Micha Sharir

Institutions: Duke University, Tel Aviv University

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, German-Israeli Foundation for Scientific Research and Development, Multidisciplinary University Research Initiative, Army Research Office

Awards: Implementation and Experimentation with New Geometric Algorithms for Motion Planning, Studies of Geometric Algorithms and Their Applicatins, Geometric Algorithms and their Applications