Geometric optimization and sums of algebraic functions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 906-917

  Vigneron, Antoine ^a  

^a UR341 National Agronomical Research Institute (INRA)   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FUNCTIONS;

ALGEBRAIC FUNCTIONS; AXIALLY SYMMETRIC; DESCRIPTION COMPLEXITY; GEOMETRIC OPTIMIZATION; GEOMETRIC PROBLEMS; GEOMETRIC SHAPE; OPTIMIZATION TECHNIQUES; SYMMETRIC DIFFERENCE;

GEOMETRY;

EID: 77951698315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.73     Document Type: Conference Paper

References (25)

1. P. Agarwal, O. Schwarzkopf, and M. Sharir. The overlay of lower envelopes and its applications. Discrete & Computational Geometry, 15(1):1-13, 1996. (Pubitemid 126317926)
2. H.-K. Ahn, P. Brass, O. Cheong, H.-S. Na, C.-S. Shin, and A. Vigneron. Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. Computational Geometry: Theory and Applications, 33(3):152-164, 2006.
3. H.-K. Ahn, O. Cheong, C.-D. Park, C.-S. Shin, and A. Vigneron. Maximizing the overlap of two planar convex sets under rigid motions. Computational Geometry: Theory and Applications, 37(1):3-15, 2007.
4. H. Alt, U. Fuchs, G. Rote, and G. Weber. Matching convex shapes with respect to the symmetric difference. Algorithmica, 21(1):89-103, 1998.
5. N. Amato, M. Goodrich, and E. Ramos. Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 705-706, 2000.
6. E. Arkin, Y. Chiang, M. Held, J. Mitchell, V. Sacristan, S. Skiena, and T.-H. Yang. On minimum-area hulls. Algorithmica, 21(1):119-136, 1998.
7. G. Barequet and V. Rogol. Maximizing the area of an axially symmetric polygon inscribed in a simple polygon. Computers & Graphics, 31(1):127-136, 2007.
8. S. Basu, R. Pollack, and M.-F. Roy. On computing a set of points meeting every cell defined by a family of polynomials on a variety. Journal of Complexity, 13(1):28-37, 1997.
9. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry. Springer-Verlag, 2006.
10. D. Chen, O. Daescu, Y. Dai, N. Katoh, X. Wu, and J. Xu. Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications. Journal of Combinatorial Optimization, 9(1):69-90, 2005.
11. O. Cheong, A. Efrat, and S. Har-Peled. Finding a guard that sees most and a shop that sells most. Discrete & Computational Geometry, 37(4):545-563, 2007.
12. O. Daescu and J. Palmer. Minimum separation in weighted subdivisions. International Journal of Computational Geometry and Applications, 19(1):33-57, 2009.
13. D. Halperin. Arrangements. In J. Goodman and J. O'Rourke, editors, Handbook of Discrete and Computational Geometry. CRC Press, 2004.
14. S. Har-Peled. How to get close to the median shape. Computational Geometry: Theory and Applications, 36(1):39-51, 2007.
15. S. Har-Peled, V. Koltun, D. Song, and K. Goldberg. Efficient algorithms for shared camera control. In Proc. ACM Symposium on Computational Geometry, pages 68-77, 2003.
16. V. Koltun. Almost tight upper bounds for vertical decompositions in four dimensions. Journal of the ACM, 51(5):699-730, 2004. (Pubitemid 40119865)
17. V. Koltun and M. Sharir. On overlays and minimization diagrams. Discrete & Computational Geometry, 41(3):385-397, 2009.
18. J. Majhi, R. Janardan, M. Smid, and P. Gupta. On some geometric optimization problems in layered manufacturing. Computational Geometry: Theory and Applications, 12(3-4):219-239, 1999. (Pubitemid 129550141)
19. J. Mitchell and C. Papadimitriou. The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM, 38(1):18-73, 1991.
20. D. Mount, R. Silverman, and A. Wu. On the area of overlap of translated polygons. Computer Vision and Image Understanding, 64(1):53-61, 1996.
21. J. O'Rourke. Advanced problem 6369. The American Mathematical Monthly, 88(10):769, 1981.
22. F. Preparata and I. Shamos. Computational geometry: An introduction. Texts and Monographs in Computer Science. Springer-Verlag, New York, 2nd edition, 1985.
23. J. Renegar. On the computational complexity of approximating solutions for real algebraic formulae. SIAM Journal on Computing, 21(6):1008-1025, 1992.
24. M. Sharir and P. Agarwal. Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, 1995.
25. H. Shaul and D. Halperin. Improved construction of vertical decompositions of three-dimensional arrangements. In Proc. ACM Symposium on Computational Geometry, pages 283-292, 2002.