Pankaj K. Agarwal
- 1.P. Agarwal, B. Aronov and M. Sharir, Computing lower envelopes in four dimensions with applications, Proc. l Oth Annual Symp. on Computational Geometry, 1994, 348-358. Google Scholar
Digital Library
- 2.P. Agarwal, O. Schwarzkopf and M. Sharir, The overlay of lower envelopes in three dimensions and its applications, this proceedings. Google ScholarDigital Library
- 3.P. Agarwal, M. Shark, and S. Toledo, New applications of parametric searching in computational geometry, J. Algorithms 17 (1994), 292-318. Google ScholarDigital Library
- 4.A. Aggarwal and S. Suri, The biggest diagonal in a simple polygon, Inf. Proc. Letters 35 (1990), 13-18. Google ScholarDigital Library
- 5.H. BrSnnimann and B. Chazelle, Optimal slope selection via cuttings, Proc. 6th Canadian Conf. on Computational Geometry, 1994, 99-103.Google Scholar
- 6.B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, Diameter, width, closest line pair, and parametric searching, Discrete Comput. Geom. 10 (1993), 183-196.Google ScholarDigital Library
- 7.B. ChazeUe, H. Edelsbrunner, L. Guibas, and M. Sharir, A singly exponential stratification scheme for real semi-algebraic varieties and its applications, Proc. 16th Int. Colloq. on Automata, Languages and Programming, (1989), 179-192. Lecture Notes in Computer Sciences, vol. 371, Springer-Verlag, Berlin. (Also in Theoretical Computer Science 84 (~99x), 77-~05.) Google ScholarDigital Library
- 8.B. Chazelle and M. Sharir, An algorithm for generalized point location and its applications, J. Symbolic Computation 10 (1990), 281-309. Google ScholarDigital Library
- 9.K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir and E. Welzl, Combinatorial complexity bounds for arrangements of curves and spheres, Discrete Cornput. Geom. 5 (1990), 99-160.Google ScholarDigital Library
- 10.K. Clarkson and P. Shot, Applications of random sampling in computational geometry II, Discrete Comput. Geom. 4 (1989), 387-421.Google ScholarDigital Library
- 11.M. Dillencourt, D. Mount, and N. Netanyahu, A randomized algorithm for slope selection, int. J. Comput. Geom. and Appls 2 (1992), 1-27.Google ScholarCross Ref
- 12.M. de Berg, K. Dobrindt, and O. Schwarzkopf, On lazy randomized incremental construction, Proc. 26th Annual ACM Symp. on Theory of Computing, 1994, 105-114. Google ScholarDigital Library
- 13.M. de Berg, D. Halperin, and L. Guibas, Vertical decomposition for triangles in 3-space, Proc. l Oth Annual Syrup. Computational Geometry, 1994, 1-10. Google ScholarDigital Library
- 14.H. Ebara, N. Fukuyama, H. Nakano, and Y. Nakanishi, Roundness algorithms using the Voronoi diagrams, First Canadian Conf. on Computational Geometry, 1989.Google Scholar
- 15.D. Halperin and M. Sharir, New bounds for lower envelopes in 3 dimensions, with applications to visibility in terrains, Discrete Comput. Geom. 12 (1994), 313-326.Google ScholarDigital Library
- 16.D. Haussler and E. Welzl, e-nets and simplex range queries, Discrete Comput. Geom. 2 (1987), 127-151.Google ScholarDigital Library
- 17.M. Houle and G. Toussaint, Computing the width of a set, IEEE 2kansactions on Pattern Anal. and Mach. Intell. 5 (1988), 761-765. Google ScholarDigital Library
- 18.M. Katz and M. Shark, Optimal slope selection via expanders, Inf. Proc. Letters 47 (1993), 115-122. Google ScholarDigital Library
- 19.M. Katz and M. Sharir, An expander-based approach to geometric optimization, Proc. 9th Annual $ymp. on Computational Geometry, 1993, 198-207. Google ScholarDigital Library
- 20.J. Matou~ek, Randomized optimal algorithm for slope selection, Info. Proc. Letters 39 (1991), 183- 187. Google ScholarDigital Library
- 21.N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, J. A CM 30 (1983), 852-865. Google ScholarDigital Library
- 22.M. Sharir, Almost tight upper bounds for lower envelopes in higher dimensions, Discrete Comput. Geom. 12 (1994), 327-345.Google ScholarDigital Library
- 23.M. Shark and P. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, Cambridge-New York- Melbourne, 1995. Google ScholarDigital Library
- 24.M. Staid and R. Janardan, On the width and roundness of a set of points in the plane, manascript, 1995.Google Scholar
Index Terms
- Efficient randomized algorithms for some geometric optimization problems
Recommendations
Efficient randomized algorithms for some geometric optimization problems
In this paper we first prove the following combinatorial bound, concerning the complexity of the vertical decomposition of the minimization diagram of trivariate functions: Let $$\mathcal{F}$$ be a collection ofn totally or partially defined algebraic ...
Improved Genetic Algorithms to Solving Constrained Optimization Problems
CINC '09: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01The slow convergence speed and the lack of effective constraint handling strategies are the major concerns when applying genetic algorithms (Gas) to constrained optimization problem. An improved genetic algorithm was proposed by dividing population into ...
An innovative artificial immune optimisation algorithm for solving complex optimisation problems
The main contribution of this paper is to develop an innovative artificial immune optimisation algorithm, called AIO, for solving complex optimisation problems. The proposed population-based algorithm has the ability of escaping from local optima and ...
Comments