Optimal placement of convex polygons to maximize point containment

Authors:
Matthew Dickerson;Daniel Scharstein
Affiliations:
Department of Math and Computer Science, Middlebury College, Middlebury, VT;Department of Computer Science, Cornell University, Ithaca, NY
Venue:
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Year:
1996

Citing 5
Cited 1

Computational geometry: an introduction

Computational geometry: an introduction
An optimal algorithm for finding minimal enclosing triangles

Journal of Algorithms
New upper bounds in Klee's measure problem

SIAM Journal on Computing
Computing the smallest k-enclosing circle and related problems

Computational Geometry: Theory and Applications
Static and Dynamic Algorithms for k-Point Clustering Problems

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures

The rotation diagram and optimal containing placements of a convex polygon

Proceedings of the twelfth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract