Solving Geometric Optimization Problems using Graphics Hardware

Computer Graphics Forum

Volumn 22, Issue 3, 2003, Pages 441-451

  Denny, Markus ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; COMPUTER HARDWARE; STRUCTURAL OPTIMIZATION;

GEOMETRICAL ALGORITHMS;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0141504423     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.00692     Document Type: Conference Paper

References (27)

1. Alok Aggarwal, J. S. Chang, and Chee K. Yap. Minimum area circumscribing polygons. The Visual Computer, 1(2):112-117, October 1985. 7
2. F. Aurenhammer. Voronoi diagrams - a survey of a fundamental geometric data structure. ACM Computing Surveys, 23(3):345-405, 1991. Habilitationsschrift. [Report B 90-09, FU Berlin, Germany, 1990]. 2
3. F. Aurenhammer and R. Klein. Voronoi diagrams. In J. Sack and G. Urrutia, editors, Handbook of Computational Geometry, pages 201-290. Elsevier Science Publishing, 2000. 2
4. F. Avnaim and J.-D. Boissonnat. Polygon placement under translation and rotation. In STAGS '88, volume 294 of LNCS, pages 322-333. Springer, February 1988. 9
5. Cass Everitt cass@nvidia.com. Interactive order-independent transparency. Technical Report OpenGL Applications Engineering, NVIDIA, 2002. 8
6. O. Cheong, S. Har-Peled, N. Linial, and J. Matousek. The one-round voronoi game. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pages 97-101, 2002. 4
7. Frank Dehne, Rolf Klein, and Raimund Seidel. Maximizing a voronoi region: The convex case. In ISAAC, volume 13, November 2002. 4
8. Markus O. Denny. Algorithmic Geometry via Graphics Hardware. PhD thesis, Universität des Saarlandes, to appear 2003. 4
9. DePano and Aggarwal. Finding restricted k-envelopes for convex polygons. In 22th Annual Allerton Conference on Communication, Control, and Computing, pages 81-90, 1984. 7
10. Herbert Edelsbrunner and Raimund Seidel. Voronoi diagrams and arrangements. In Joseph O'Rourke, editor, Proc. 1st ACM Symp. Computational Geometry, pages 251-262, 5-7 June 1985. 2
11. Alon Efrat, Micha Sharir, and Alon Ziv. Computing the smallest k-enclosing circle and related problems. In Workshop on Algorithms and Data Structures, pages 325-336, 1993. 8
12. David Eppstein. Geometry in action. http://www.ics.uci.edu/eppstein/geom.html, 2002. 2
13. Frank Follert, Elmar Schömer, and Jürgen Sellen. Subquadratic algorithms for the weighted maximin facility location problem. In Proc. 7th CCCG, pages 1-6, 1995. 9
14. S. J. Fortune. A fast algorithm for polygon containment by translation (extended abstract). In Automata, Languages and Programming, 12th Colloquium, volume 194 of LNCS, pages 189-198. Springer-Verlag, 15-19 July 1985. 9
15. Herbert Freeman and Ruth Shapira. Determining the minimum-area encasing rectangle for an arbitrary closed curve, Communications of the ACM, 18(7):409-413, July 1975. 7
16. Bernd Gärtner and Sven Schönherr. Exact primitives for smallest enclosing ellipses. Information Processing Letters, 68(1):33-38, 1998. 7
17. Kenneth E. Hoff III, John Keyser, Ming Lin, Dinesh Manocha, and Tim Culver. Fast computation of generalized Voronoi diagrams using graphics hardware. Computer Graphics, 33(Annual Conference Series):277-286, 1999. 1,2,4
18. D. T. Lee and Y. F. Wu. Geometric complexity of some location problems. Algorithmica, 1:193-211, 1986. 8
19. D. Leven and M. Sharir. Planning a purely translational motion for a convex object in a two dimensional space using generalized voronoi diagrams. Discrete and Computational Geometry, 2:9-31, 1987. 9
20. Dinesh Manocha. Interactive geometric computations using graphics hardware. SIGGRAPH course notes, 2002(31), 2002. 1
21. 3 and related problems. SIAM Journal on Computing, 12(4):759-776, 1983. 7
22. Atsuyuki Okabe, Barry Boots, and Kokichi Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Probability and Mathematical Statistics. John Wiley & Sons, Chichester, England, September 1992. foreword by D. G. Kendall. 2, 3
23. Franco P. Preparata and Michael Ian Shamos. Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer-Verlag, New York NY, 1995. corrected and expanded second printing, 1988. 8
24. Christian Schwarz, Jürgen Teich, Emo Welzl, and Brian Evans. On finding a minimal enclosing parallelogram. Technical Report TR-94-036, Berkeley, CA, 1994. 7
25. Michael Ian Shamos and Dan Hoey. Closest-point problems. In Proc. 16th Annual Symp. Foundations of Computer Science, pages 151-162. IEEE Computer Society, 13-15 October 1975. 8
26. Sharir and Toledo. Extremal polygon containment problems. CGTA: Computational Geometry: Theory and Applications, 4, 1994. 8
27. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In Proceedings of New Results and New Trends in Computer Science, volume 555 of LNCS, pages 359-370, Berlin, Germany, June 1991. Springer. 7