On geometric optimization with few violated constraints
- J. Matoušek
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
We investigate the problem of finding the best solution satisfying all butk of the given constraints, for an abstract class of optimization problems introduced by Sharir and Welzl—the so-calledLP-type problems. We give a general algorithm and discuss its efficient implementations for specific geometric problems. For instance for the problem of computing the smallest circle enclosing all butk of the givenn points in the plane, we obtain anO(n logn+k 3 n ε) algorithm; this improves previous results fork small compared withn but moderately growing. We also establish some results concerning general properties ofLP-type problems.
- P. Agarwal, M. de Berg, J. Matoušek, and O. Schwarzkopf. Constructing levels in arrangements and higher-order Voronoi diagrams.Proc. 10th Ann. ACM Symp. on Computational Geometry, pp. 67–75, 1994.
- Agarwal, P. K., Matoušek, J. (1995) Dynamic half-space range reporting and its applications. Algorithmica 13: pp. 325-345 CrossRef
- Aggarwal, A., Imai, H., Katoh, N., Suri, S. (1991) Findingk points with minimum diameter and related problems. J. Algorithms 12: pp. 38-56 CrossRef
- Amenta, N. (1994) Helly theorems and generalized linear programming. Discrete Comput. Geom. 12: pp. 241-261 CrossRef
- Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L. J., Sharir, M., Wenger, R. (1991) Points and triangles in the plane and halving planes in space. Discrete Comput. Geom. 6: pp. 435-442 CrossRef
- B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension.Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pp. 281–290, 1993.
- Clarkson, K. L. (1987) New applications of random sampling in computational geometry. Discrete Comput. Geom. 2: pp. 195-222 CrossRef
- K. L. Clarkson. A Las Vegas algorithm for linear programming when the dimension is small.Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science, pp. 452–456, 1988.
- K. L. Clarkson. A bound on local minima of arrangements that implies the upper bound theorem. Manuscript, 1992.
- Clarkson, K. L., Shor, P. W. (1989) Application of random sampling in computational geometry, II. Discrete Comput. Geom. 4: pp. 387-421 CrossRef
- Cole, R., Sharir, M., Yap, C. K. (1987) Onk-hulls and related problems. SIAM J. Comput. 16: pp. 61-77 CrossRef
- Datta, A., Lenhof, H.-P., Schwarz, C., Smid, M. (1993) Static and dynamic algorithms fork-point clustering problems. Proc. 3rd Workshop on Algorithms and Data Structures. Springer-Verlag, Berlin, pp. 265-276
- Dey, T., Edelsbrunner, H. (1994) Counting triangle crossings and halving planes. Discrete Comput. Geom. 12: pp. 281-289 CrossRef
- Edelsbrunner, H., Mücke, E. P. (1990) Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graphics 9: pp. 66-104 CrossRef
- A. Efrat, M. Lindenbaum, and M. Sharir, Finding maximally consistent sets of halfspaces.Proc. 5th Canad. Conf. on Computational Geometry, pp. 432–436, Waterloo, Ontario, 1993.
- Efrat, A., Sharir, M., Ziv, A. (1993) Computing the smallestk-enclosing circle and related problems. Proc. 3rd Workshop on Algorithms and Data Structures. Springer-Verlag, Berlin, pp. 325-336
- I. Emiris and J. Canny. An efficient approach to removing geometric degeneracies.Proc. 8th Ann. ACM Symp. on Computational Geometry, pp. 74–82, 1992.
- D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes.Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pp. 64–73, 1993.
- H. Everett, J.-M. Robert, and M. van Kreveld. An optimal algorithm for the (≤k)-levels, with applications to separation and transversal problems.Proc. 9th Ann. ACM Symp. on Computational Geometry, pp. 38–46, 1993.
- Gajentaan, A., Overmars, M. H. (1993) n 2-hard problems in computational geometry. Department of Computer Science, Utrecht University, Utrecht
- B. Gärtner. A subexponential algorithm for abstract optimization problems.Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science, pp. 464–472, 1992.
- Johnson, D. S., Preparata, F. P. (1978) The densest hemisphere problem. Theoret. Comput. Sci. 6: pp. 93-107 CrossRef
- G. Kalai, A subexponential randomized simplex algorithm.Proc. 24th Ann. ACM Symp. on Theory of Computing, pp. 475–482, 1992.
- Matoušek, J. (1993) Linear optimization queries. J. Algorithms 14: pp. 432-448 CrossRef
- Matoušek, J. (1995) On enclosingk points by a circle. Inform. Process. Lett. 53: pp. 217-221 CrossRef
- J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming.Proc. 8th Ann. ACM Symp. on Computational Geometry, pp. 1–8, 1992. Also to appear inAlgorithmica.
- Megiddo, N. (1983) The weighted Euclidean 1-center problem. Math. Oper. Res. 8: pp. 498-504 CrossRef
- Mulmuley, K. (1991) On levels in arrangements and Voronoi diagrams. Discrete Comput. Geom. 6: pp. 307-338 CrossRef
- K. Mulmuley. Dehn-Sommerville relations, upper bound theorem, and levels in arrangements.Proc. 9th Ann. ACM Sump. on Computational Geometry, pp. 240–246, 1993.
- Overmars, M. H., Leeuwen, J. (1981) Maintenance of configurations in the plane. J. Comput. System Sci. 23: pp. 166-204 CrossRef
- Seidel, R. (1994) The nature and meaning of perturbations in geometric computing. Proc. 11th Symp. on Theoretical Aspects of Computer Science (STACS). Springer-Verlag, Berlin
- Sharir, M., Welzl, E. (1992) A combinatorial bound for linear programming and related problems. Proc. 1992 Symp. on Theoretical Aspects of Computer Science. Springer-Verlag, Berlin, pp. 569-579
- Yap, C. K. (1990) A geometric consistency theorem for a symbolic perturbation scheme. J. Comput. System Sci. 40: pp. 2-18 CrossRef
- On geometric optimization with few violated constraints
Discrete & Computational Geometry
Volume 14, Issue 1 , pp 365-384
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors
- J. Matoušek (1)
- Author Affiliations
- 1. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 11800, Praha 1, Czech Republic